Two-machine flow shop scheduling with one non-availability interval
From MaRDI portal
Cites work
- A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
- A PTAS for non-resumable open shop scheduling with an availability constraint
- 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 flow shop scheduling with an availability constraint and nonresumable jobs
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Approximation results for flow shop scheduling problems with machine availability constraints
- Machine scheduling with an availability constraint
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- Optimal two- and three-stage production schedules with set-up time included
- Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
- Two-machine flowshop scheduling with availability constraints
- Two-machine open shop scheduling with an availability constraint
This page was built for publication: Two-machine flow shop scheduling with one non-availability interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442705)