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

DOI10.1016/J.COR.2014.02.002zbMATH Open1348.90272OpenAlexW2027361800MaRDI QIDQ337017FDOQ337017

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

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

Cites Work

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

Cited In (4)

• Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
• Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
• The third comprehensive survey on scheduling problems with setup times/costs
• Algorithms for a two‐machine flowshop problem with jobs of two classes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337017)