A Note on Heuristics of Flow-Shop Scheduling

DOI10.1287/opre.44.4.648zbMath0865.90079OpenAlexW2106940228MaRDI QIDQ5689787

Tsung-Chyan Lai

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

zbMATH Keywords

heuristicworst-case performance ratio\(m\)-machine, \(n\)-job permutation flow-shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

A worst-case analysis of the three-machine flow shop scheduling ⋮ Experimental comparison of heuristics for flow shop scheduling ⋮ Unnamed Item ⋮ A new lower bounding rule for permutation flow shop scheduling ⋮ A modification to the CGPS algorithm for three-machine flow shop scheduling ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ Flexible flow shop scheduling with uniform parallel machines ⋮ Non-bottleneck machines in three-machine flow shops ⋮ Performance guarantees for flowshop heuristics to minimize makespan

This page was built for publication: A Note on Heuristics of Flow-Shop Scheduling