Minimizing tardiness in a two-machine flow-shop

DOI10.1016/S0305-0548(00)00090-3zbMath0995.90035OpenAlexW2113526966MaRDI QIDQ5959377

Jason Chao-Hsien Pan, Chii-Ming Chao, Jen-Shiang Chen

Publication date: 3 April 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00090-3

zbMATH Keywords

branch-and-bound algorithmtotal tardinesstwo-machine flow-shop scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (14)

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 high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ A multi-objective particle swarm for a flow shop scheduling problem ⋮ Two-machine flow shop total tardiness scheduling problem with deteriorating jobs ⋮ Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling ⋮ A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop ⋮ A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness ⋮ No-wait flow shop scheduling using fuzzy multi-objective linear programming ⋮ A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem ⋮ Minimizing total tardiness on a two-machine re-entrant flowshop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The two-machine flowshop scheduling problem with total tardiness
• On two-machine scheduling with release and due dates to minimize maximum lateness
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• A decomposition algorithm for the single machine total tardiness problem
• Optimal two- and three-stage production schedules with setup times included
• Minimizing Total Tardiness on One Machine is NP-Hard
• On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Two-machine flowshop scheduling to minimize total tardiness
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A total tardiness problem with preprocessing included

This page was built for publication: Minimizing tardiness in a two-machine flow-shop