Optimality of Jackson's permutations with respect to limited machine availability
From MaRDI portal
Publication:5488246
DOI10.1111/j.1475-3995.2006.00533.xzbMath1127.90351OpenAlexW1994491778MaRDI QIDQ5488246
Oliver Braun, Natalja M. Leshchenko, Yuri N. Sotskov
Publication date: 14 September 2006
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2006.00533.x
Related Items (1)
Cites Work
- Machine scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Current trends in deterministic scheduling
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Scheduling with limited machine availability
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- Stability of Johnson's schedule with respect to limited machine availability
- Two-machine flow shops with limited machine availability
This page was built for publication: Optimality of Jackson's permutations with respect to limited machine availability