Stability of Johnson's schedule with respect to limited machine availability
From MaRDI portal
Publication:4706332
DOI10.1080/00207540210159527zbMath1064.90543OpenAlexW2018372294MaRDI QIDQ4706332
Yuri N. Sotskov, Oliver Braun, Günter Schmidt, Tsung-Chyan Lai
Publication date: 2002
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540210159527
Related Items (9)
Optimality region for job permutation in single-machine scheduling with uncertain processing times ⋮ Exact solutions for the two-machine robust flow shop with budgeted uncertainty ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times ⋮ Comparing deterministic, robust and online scheduling using entropy ⋮ Two-machine flow shop scheduling integrated with preventive maintenance planning ⋮ Single machine scheduling problem with interval processing times and total completion time objective ⋮ Optimality of Jackson's permutations with respect to limited machine availability
Cites Work
- Stability of an optimal schedule
- 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
- Optimal schedules with infinitely large stability radius∗
- Two-machine flow shops with limited machine availability
This page was built for publication: Stability of Johnson's schedule with respect to limited machine availability
