Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times

DOI10.1016/j.cor.2014.02.002zbMath1348.90272OpenAlexW2027361800MaRDI QIDQ337017

Yeong-Dae Kim, BongJoo Jeong

Publication date: 10 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2014.02.002

zbMATH Keywords

heuristicsschedulingbranch and boundsequence-dependent setup timesre-entrant flowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

The third comprehensive survey on scheduling problems with setup times/costs ⋮ Algorithms for a two‐machine flowshop problem with jobs of two classes ⋮ Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem

Cites Work

• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• Minimizing total tardiness on a two-machine re-entrant flowshop
• 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
• Tabu search for total tardiness minimization in flowshop scheduling problems
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• Note on minimizing total tardiness in a two-machine flowshop
• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Multi-family scheduling in a two-machine reentrant flow shop with setups
• Optimal two- and three-stage production schedules with setup times included
• Focused Scheduling in Proportionate Flowshops
• A dual algorithm for the one-machine scheduling problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing makespan in re-entrant permutation flow-shops
• The Total Tardiness Problem: Review and Extensions
• Minimizing makespan on a two-machine re-entrant flowshop

This page was built for publication: Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times