Two-machine flowshop scheduling to minimize total tardiness

DOI10.1080/00207729708929401zbMath0887.90090OpenAlexW2057974816WikidataQ126250364 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-boundsequencingtwo-machine flowshoptotal tardinessprecedence relations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Note on minimizing total tardiness in a two-machine flowshop ⋮ An assignment-based lower bound for a class of two-machine flow shop problems ⋮ A two-machine flowshop scheduling problem with precedence constraint on two jobs ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness ⋮ Minimizing tardiness in a two-machine flow-shop ⋮ Minimizing total tardiness on a two-machine re-entrant 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

This page was built for publication: Two-machine flowshop scheduling to minimize total tardiness