Two-machine shop scheduling with zero and unit processing times

DOI10.1016/S0377-2217(97)00337-8zbMath0943.90036OpenAlexW2070748647MaRDI QIDQ1296097

Svetlana A. Kravchenko, Irina 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

zbMATH Keywords

open shoppolynomial algorithmtwo machine flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

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