An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion

DOI10.1080/02522667.2002.10699531zbMath1078.90537OpenAlexW2046861767MaRDI QIDQ4812724

Huey-Chin Tang

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.10699531

zbMATH Keywords

minimum makespan criterion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Experimental comparison of heuristics for flow shop scheduling

Cites Work

• Unnamed Item
• An adaptive branching rule for the permutation flow-shop problem
• Some results of the worst-case analysis for flow shop scheduling
• A new lower bounding rule for permutation 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
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• The Complexity of Flowshop and Jobshop Scheduling
• A New Heuristic for Three-Machine Flow Shop Scheduling
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion