A worst-case analysis of the three-machine flow shop scheduling
From MaRDI portal
Publication:4812717
DOI10.1080/02522667.2002.10698993zbMath1048.90108OpenAlexW2064335867MaRDI QIDQ4812717
Publication date: 23 August 2004
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.2002.10698993
Cites Work
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Some results of the worst-case analysis for flow shop scheduling
- A modification to the CGPS algorithm for three-machine flow shop scheduling
- Optimal two- and three-stage production schedules with setup times included
- The Lessons of Flowshop Scheduling Research
- Flowshop and Jobshop Schedules: Complexity and Approximation
- The Complexity of Flowshop and Jobshop Scheduling
- A New Heuristic for Three-Machine Flow Shop Scheduling
- Short Shop Schedules
- A Note on Heuristics of Flow-Shop Scheduling
This page was built for publication: A worst-case analysis of the three-machine flow shop scheduling