A modification to the CGPS algorithm for three-machine flow shop scheduling
From MaRDI portal
Publication:2766119
DOI10.1080/02522667.2001.10699494zbMath0980.90029OpenAlexW1987889556MaRDI QIDQ2766119
Publication date: 27 January 2002
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.2001.10699494
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
A worst-case analysis of the three-machine flow shop scheduling ⋮ Experimental comparison of heuristics for flow shop scheduling ⋮ An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion
Cites Work
- Some results of the worst-case analysis for flow shop scheduling
- Optimal two- and three-stage production schedules with setup times included
- The Lessons of Flowshop Scheduling Research
- The Complexity of Flowshop and Jobshop Scheduling
- A New Heuristic for Three-Machine Flow Shop Scheduling
- A Note on Heuristics of Flow-Shop Scheduling
This page was built for publication: A modification to the CGPS algorithm for three-machine flow shop scheduling
