An improved heuristic for two-machine flowshop scheduling with an availability constraint
From MaRDI portal
Publication:1591549
DOI10.1016/S0167-6377(00)00033-XzbMath0982.90022OpenAlexW1971197618MaRDI QIDQ1591549
Guoqing Wang, Cheng, T. C. Edwin
Publication date: 29 March 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(00)00033-x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Heuristics for two-machine flowshop scheduling with setup times and an availability constraint ⋮ An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint ⋮ Two-machine flow shop scheduling with an operator non-availability period to minimize makespan ⋮ An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint ⋮ An improved algorithm for the two machine flow shop problem with several availability constraints ⋮ Single-machine scheduling with periodic maintenance to minimize makespan revisited ⋮ Minimizing the makespan for the flow shop scheduling problem with availability constraints. ⋮ The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis ⋮ Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period ⋮ Approximation results for flow shop scheduling problems with machine availability constraints ⋮ A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints ⋮ An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs ⋮ A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint ⋮ Scheduling two-stage hybrid flow shop with availability constraints ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Two-machine flow shop and open shop scheduling problems with a single maintenance window ⋮ Approximation results for the two-machine job shop under limited machine availability ⋮ Makespan minimization for two parallel machines scheduling with a periodic availability constraint ⋮ A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints ⋮ Two-machine scheduling with periodic availability constraints to minimize makespan ⋮ Stability of Johnson's schedule with respect to limited machine availability ⋮ A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ Optimality of Jackson's permutations with respect to limited machine availability ⋮ Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
Cites Work
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability
- Two-machine flowshop scheduling with consecutive availability constraints
- Optimal two- and three-stage production schedules with setup times included
