Two-machine open shop scheduling with an availability constraint
From MaRDI portal
Recommendations
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
- A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
- An approximation algorithm for two-machine scheduling with an availability constraint
- A PTAS for non-resumable open shop scheduling with an availability constraint
Cites work
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity
- Dual criteria preemptive open-shop problems with minimum makespan
- Machine scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Open Shop Scheduling to Minimize Finish Time
- Optimal two- and three-stage production schedules with set-up time included
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
- Scheduling with limited machine availability
- Short Shop Schedules
- Two-machine flow shops with limited machine availability
- Two-machine flowshop scheduling with availability constraints
- Two-machine flowshop scheduling with consecutive availability constraints
Cited in
(20)- scientific article; zbMATH DE number 5260089 (Why is no real title available?)
- A desired load distribution model for scheduling of unrelated parallel machines
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs
- A PTAS for non-resumable open shop scheduling with an availability constraint
- Two-machine open shop problem with agreement graph
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- scientific article; zbMATH DE number 5732726 (Why is no real title available?)
- Open shop scheduling problem with a non-resumable flexible maintenance period
- Open shop scheduling problem with a flexible maintenance period: revisited
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- An approximation algorithm for two-machine scheduling with an availability constraint
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
- Optimality of Jackson's permutations with respect to limited machine availability
- Stochastic scheduling for a two-machine open shop
- The two-machine open shop problem: To fit or not to fit, that is the question
- Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
- Two-machine scheduling with periodic availability constraints to minimize makespan
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
- Non-preemptive two-machine open shop scheduling with non-availability constraints
This page was built for publication: Two-machine open shop scheduling with an availability constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949921)
