A worst-case analysis of the three-machine flow shop scheduling

DOI10.1080/02522667.2002.10698993MaRDI QIDQ4812717zbMATH OpenOpenAlexFDO

Authors Hui-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.10698993

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• A New Heuristic for Three-Machine Flow Shop Scheduling
• A note on worst-case analysis of approximation algorithms for a scheduling problem
• scientific article; zbMATH DE number 1998822
• Some results of the worst-case analysis for flow shop scheduling

Cites work

• A modification to the CGPS algorithm for three-machine flow shop scheduling
• A New Heuristic for Three-Machine Flow Shop Scheduling
• A Note on Heuristics of Flow-Shop Scheduling
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Optimal two- and three-stage production schedules with set-up time included
• Short Shop Schedules
• Some results of the worst-case analysis for flow shop scheduling
• The Complexity of Flowshop and Jobshop Scheduling
• The Lessons of Flowshop Scheduling Research
• Worst-case analysis of an approximation algorithm for flow-shop scheduling

Cited in

(5)

• Some results of the worst-case analysis for flow shop scheduling
• A note on worst-case analysis of approximation algorithms for a scheduling problem
• Three-machine flow shop scheduling with overlapping waiting time constraints
• scientific article; zbMATH DE number 1091396 (Why is no real title available?)
• A note on the proportionate flow shop with a bottleneck machine

This page was built for publication: A worst-case analysis of the three-machine flow shop scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4812717)