Multi-family scheduling in a two-machine reentrant flow shop with setups
From MaRDI portal
Publication:2467261
DOI10.1016/J.EJOR.2006.06.065zbMATH Open1137.90530OpenAlexW2000155750MaRDI QIDQ2467261FDOQ2467261
Authors: Dar-Li Yang, Wen-Hung Kuo, Maw-Sheng Chern 
Publication date: 21 January 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.065
Recommendations
- Minimizing makespan on a two-machine re-entrant flowshop
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
- Heuristic algorithms for two machine re-entrant flow shop
- Minimizing total tardiness on a two-machine re-entrant flowshop
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
Cites Work
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- A survey of scheduling problems with setup times or costs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On general routing problems
- Minimizing makespan in re-entrant permutation flow-shops
- Sequencing \(n\) jobs on two machines with arbitrary time lags
- Minimizing Makespan in a Class of Reentrant Shops
- A heuristic algorithm for two-machine re-entrant shop scheduling
- V-shop scheduling
- Sequency on two and three machines with setup, processing and removal times separated
- Two- and three-machine flow shop scheduling problems with equal sized transfer batches
- Two-machine flowshop group scheduling problem
- OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS
Cited In (9)
- Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
- A comprehensive review of flowshop group scheduling literature
- Solution strategies for multi-stage wafer probing scheduling problem with reentry
- Minimizing total tardiness on a two-machine re-entrant flowshop
- Minimizing total completion time for re-entrant flow shop scheduling problems
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
- Flow shops with reentry: reversibility properties and makespan optimal schedules
This page was built for publication: Multi-family scheduling in a two-machine reentrant flow shop with setups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467261)
