Two-machine flowshop scheduling to minimize total tardiness

DOI10.1080/00207729708929401zbMath0887.90090WikidataQ126250364 ScholiaQ126250364MaRDI QIDQ4352599

Jason Chao-Hsien Pan, En-Tsu Fan

Publication date: 4 September 1997

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729708929401

zbMATH Keywords

branch-and-bound; sequencing; two-machine flowshop; total tardiness; precedence relations

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness, Minimizing tardiness in a two-machine flow-shop, Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics, Note on minimizing total tardiness in a two-machine flowshop

Cites Work

• The two-machine flowshop scheduling problem with total tardiness
• A decomposition algorithm for the single machine total tardiness problem
• Optimal two- and three-stage production schedules with setup times included
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness