A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems

DOI10.1016/j.ejor.2004.12.023zbMath1116.90116OpenAlexW1973004385MaRDI QIDQ858325

ömer Kirca, James Flynn, Chia-Shin Chung

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.12.023

zbMATH Keywords

schedulingtardinesspermutation flowshopBranch and Bound

Mathematics Subject Classification ID

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

Related Items (7)

Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times ⋮ Minimizing the number of late jobs for the permutation flowshop problem with secondary resources ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The two-machine flowshop scheduling problem with total tardiness
• Minimizing total tardiness in permutation flowshops
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• Evaluation of leading heuristics for the single machine tardiness problem
• Improved heuristics for the \(n\)-job single-machine weighted tardiness problem
• Decomposition of the single machine total tardiness problem
• Solution of the single machine total tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• A dual algorithm for the one-machine scheduling problem
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• The Total Tardiness Problem: Review and Extensions
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness

This page was built for publication: A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems