A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
From MaRDI portal
Publication:2489279
DOI10.1016/j.cor.2005.01.004zbMath1086.90019MaRDI QIDQ2489279
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.004
Related Items
Two-machine flow shop and open shop scheduling problems with a single maintenance window, Approximation results for flow shop scheduling problems with machine availability constraints, Flow shops with machine maintenance: ordered and proportionate cases, Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics, A PTAS for non-resumable open shop scheduling with an availability constraint
Cites Work
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Two-machine flowshop scheduling with consecutive availability constraints
- Scheduling with limited machine availability
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Optimal two- and three-stage production schedules with setup times included
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- Two-machine flow shops with limited machine availability