A Note on Heuristics of Flow-Shop Scheduling
From MaRDI portal
Publication:5689787
DOI10.1287/opre.44.4.648zbMath0865.90079MaRDI QIDQ5689787
Publication date: 7 January 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.44.4.648
90B35: Deterministic scheduling theory in operations research
Related Items
Unnamed Item, A worst-case analysis of the three-machine flow shop scheduling, Experimental comparison of heuristics for flow shop scheduling, A new constructive heuristic for the flowshop scheduling problem, Some results of the worst-case analysis for flow shop scheduling, Non-bottleneck machines in three-machine flow shops, Flexible flow shop scheduling with uniform parallel machines, Performance guarantees for flowshop heuristics to minimize makespan, A new lower bounding rule for permutation flow shop scheduling, A modification to the CGPS algorithm for three-machine flow shop scheduling