Experimental comparison of heuristics for flow shop scheduling

DOI10.1080/02522667.2002.10699530zbMath1048.90109OpenAlexW2333683423MaRDI QIDQ4812723

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

Mathematics Subject Classification ID

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

Cites Work

• New results in the worst-case analysis for flow-shop scheduling
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
• Some results of the worst-case analysis for flow shop scheduling
• A note on worst-case analysis of approximation algorithms for a scheduling problem
• Benchmarks for basic scheduling problems
• 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
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• Short Shop Schedules
• An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
• A Note on Heuristics of Flow-Shop Scheduling