Minimizing total tardiness on a two-machine re-entrant flowshop

DOI10.1016/J.EJOR.2008.11.037zbMath1176.90653OpenAlexW1972299589MaRDI QIDQ1042154

Seong-Woo Choi, Yeong-Dae Kim

Publication date: 7 December 2009

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

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

zbMATH Keywords

heuristicsschedulingbranch and boundre-entrant flowshop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (7)

Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ 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 ⋮ Minimizing total completion time for re-entrant flow shop scheduling problems ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules

Cites Work

• 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
• A heuristic algorithm for two-machine re-entrant shop scheduling
• 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
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Focused Scheduling in Proportionate Flowshops
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Two-machine flowshop scheduling to minimize total tardiness
• Minimizing Makespan in a Class of Reentrant Shops
• Minimizing makespan in re-entrant permutation flow-shops
• The Total Tardiness Problem: Review and Extensions
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• Minimizing makespan on a two-machine re-entrant flowshop
• Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
• Minimizing tardiness in a two-machine flow-shop

This page was built for publication: Minimizing total tardiness on a two-machine re-entrant flowshop