A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
From MaRDI portal
Recommendations
- Two-machine open shop scheduling with an availability constraint
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Machine scheduling with an availability constraint
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
Cited in
(8)- Non-preemptive two-machine open shop scheduling with non-availability constraints
- A PTAS for non-resumable open shop scheduling with an availability constraint
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs
- Optimising lot sizing and order scheduling with non-linear production rates
- Two-machine open shop scheduling with an availability constraint
- Mathematical model for cyclic scheduling with work-in-process minimization
This page was built for publication: A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656745)
