On scheduling multiple parallel two-stage flowshops with Johnson's rule
From MaRDI portal
Publication:6197646
DOI10.1007/s10878-024-01107-zOpenAlexW4392111222MaRDI QIDQ6197646
Jianxin Wang, Guangwei Wu, Fu Zuo, Feng Shi
Publication date: 20 March 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-024-01107-z
Cites Work
- Unnamed Item
- Approximation algorithms for the parallel flow shop problem
- An FPTAS for the parallel two-stage flowshop problem
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- On scheduling multiple two-stage flowshops
- Scheduling multiple two-stage flowshops with a deadline
- Improved approximation algorithms for two-stage flowshops scheduling problem
- On scheduling inclined jobs on multiple two-stage flowshops
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
- Scheduling two-stage jobs on multiple flowshops
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
- Optimal two- and three-stage production schedules with setup times included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
