Two-machine shop scheduling with zero and unit processing times

DOI10.1016/S0377-2217(97)00337-8zbMATH Open0943.90036OpenAlexW2070748647MaRDI QIDQ1296097FDOQ1296097

Svetlana A. Kravchenko, I. N. Lushchakova

Publication date: 11 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00337-8

Recommendations

• scientific article; zbMATH DE number 930117
• scientific article; zbMATH DE number 2109433
• Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

zbMATH Keywords

polynomial algorithmopen shoptwo machine flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• The Complexity of Flowshop and Jobshop Scheduling
• Title not available (Why is that?)
• Scheduling independent tasks to reduce mean finishing time
• Unit Execution Time Shop Problems
• Some no-wait shops scheduling problems: Complexity aspect
• Scheduling the Open Shop to Minimize Mean Flow Time
• Title not available (Why is that?)
• Open shop problems with unit time operations
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Two-machine interval shop scheduling with time lags
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems

This page was built for publication: Two-machine shop scheduling with zero and unit processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296097)