Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
From MaRDI portal
Publication:6164382
DOI10.1016/j.cor.2023.106183MaRDI QIDQ6164382
Chengbin Chu, Zhengwen He, Zhen Yang, Shuang Zheng, Nengmin Wang
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
- Heuristic algorithms for two machine re-entrant flow shop
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- Minimizing total tardiness on a two-machine re-entrant flowshop
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem
- An exact algorithm for large multiple knapsack problems
- A heuristic algorithm for two-machine re-entrant shop scheduling
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- The hybrid flow shop scheduling problem
- Flow shops with reentry: reversibility properties and makespan optimal schedules
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Multi-family scheduling in a two-machine reentrant flow shop with setups
- Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing Makespan in a Class of Reentrant Shops
- Minimizing makespan on a two-machine re-entrant flowshop
This page was built for publication: Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
