Optimality of Jackson's permutations with respect to limited machine availability
From MaRDI portal
Publication:5488246
Recommendations
- Stability of Johnson's schedule with respect to limited machine availability
- Two-machine flow shops with limited machine availability
- Two-machine open shop scheduling with an availability constraint
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Non-preemptive two-machine open shop scheduling with non-availability constraints
Cites work
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Current trends in deterministic scheduling
- Machine scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Scheduling with limited machine availability
- Stability of Johnson's schedule with respect to limited machine availability
- Two-machine flow shops with limited machine availability
Cited in
(3)- Short‐term crude oil scheduling with preventive maintenance operations: a fuzzy stochastic programming approach
- A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection
- Stability of Johnson's schedule with respect to limited machine availability
This page was built for publication: Optimality of Jackson's permutations with respect to limited machine availability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488246)
