Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem
From MaRDI portal
Publication:4158783
DOI10.1287/opre.25.1.70zbMath0379.90051MaRDI QIDQ4158783
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.25.1.70
90B35: Deterministic scheduling theory in operations research
Related Items
Unnamed Item, On no-wait and no-idle flow shops with makespan criterion, Production scheduling with applications in the printing industry, Two-stage flowshop scheduling with a common second-stage machine, Sequency on two and three machines with setup, processing and removal times separated