An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
From MaRDI portal
Publication:2390265
DOI10.1016/j.ipl.2004.03.004zbMath1178.68097MaRDI QIDQ2390265
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.004
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Optimality of Jackson's permutations with respect to limited machine availability, An improved algorithm for the two machine flow shop problem with several availability constraints, A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints, A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints, Heuristics for two-machine flowshop scheduling with setup times and an availability constraint, An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint, Approximation results for flow shop scheduling problems with machine availability constraints, An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs, Setting a common due date in a constrained flowshop: a variable neighbourhood search approach, Flow shops with machine maintenance: ordered and proportionate cases, Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics, A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
Cites Work
- Machine scheduling with availability constraints
- 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
- Optimal two- and three-stage production schedules with setup times included
- Two-machine flow shops with limited machine availability
