A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops

DOI10.1016/0305-0548(93)90083-UzbMath0779.90043MaRDI QIDQ1260741

Yeong-Dae Kim

Publication date: 25 August 1993

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

zbMATH Keywords

branch and bound; lower bounds; two-machine flowshop scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90-08: Computational methods for problems pertaining to operations research and mathematical programming

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, A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems, A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times, Minimizing total tardiness in permutation flowshops, A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications, Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem, Note on minimizing total tardiness in a two-machine flowshop, A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Cites Work

• Unnamed Item
• Unnamed Item
• Generating improved dominance conditions for the flowshop problem
• The two-machine flowshop scheduling problem with total tardiness
• A new integer programming formulation for the permutation flowshop problem
• A decomposition algorithm for the single machine total tardiness problem
• Optimal two- and three-stage production schedules with setup times included
• Focused Scheduling in Proportionate Flowshops
• On general routing problems
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness