Flow shops with reentry: reversibility properties and makespan optimal schedules

DOI10.1016/j.ejor.2019.09.036zbMath1430.90297OpenAlexW2975789014WikidataQ127199374 ScholiaQ127199374MaRDI QIDQ2282537

Tae-Sun Yu, Michael L. Pinedo

Publication date: 8 January 2020

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

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

zbMATH Keywords

schedulingproportionate flow shopordered flow shopjob reentry

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Job scheduling of diffusion furnaces in semiconductor fabrication facilities ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Hybrid flow-shop manufacturing network reliability optimization using genetic algorithm and absorbing Markov chain ⋮ Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem ⋮ The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem

Cites Work

• The three-machine proportionate open shop and mixed shop minimum makespan problems
• V-shop scheduling
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Minimizing total weighted completion time in a proportionate flow shop
• Minimizing makespan in hybrid flowshops
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• The three-machine proportionate flow shop problem with unequal machine speeds
• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Multi-family scheduling in a two-machine reentrant flow shop with setups
• Review of the ordered and proportionate flow shop scheduling research
• Focused Scheduling in Proportionate Flowshops
• A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
• The Reversibility Property of Production Lines
• Minimizing the Expected Makespan in Stochastic Flow Shops
• A Broader View of the Job-Shop Scheduling Problem
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• The Complexity of Flowshop and Jobshop Scheduling
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Minimizing Makespan in a Class of Reentrant Shops
• Minimizing makespan in re-entrant permutation flow-shops
• The Total Tardiness Problem: Review and Extensions
• Minimizing makespan on a two-machine re-entrant flowshop
• Scheduling
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan

This page was built for publication: Flow shops with reentry: reversibility properties and makespan optimal schedules