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

DOI10.1016/J.COR.2014.02.002MaRDI QIDQ337017zbMATH OpenOpenAlexFDO

Authors BongJoo Jeong, Yeong-Dae Kim

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)

Recommendations

• Minimizing total tardiness on a two-machine re-entrant flowshop
• Minimizing makespan on a two-machine re-entrant flowshop
• Minimizing tardiness in a two-machine flow-shop
• Heuristic algorithms for two machine re-entrant flow shop
• The two-machine flowshop scheduling problem with total tardiness

Cites work

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

Cited in

(7)

• 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
• Multi-family scheduling in a two-machine reentrant flow shop with setups
• Algorithms for a two‐machine flowshop problem with jobs of two classes
• Minimizing total tardiness on a two-machine re-entrant flowshop
• The third comprehensive survey on scheduling problems with setup times/costs
• Two machines flow shop with reentrance and exact time lag

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)