Two-machine open shop scheduling with an availability constraint
From MaRDI portal
Publication:5949921
DOI10.1016/S0167-6377(01)00079-7zbMath0981.90023MaRDI QIDQ5949921
Vitaly A. Strusevich, Günter Schmidt, Joachim Breit
Publication date: 5 December 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Complexity and performance of numerical algorithms (65Y20)
Related Items
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, Open shop scheduling problem with a non-resumable flexible maintenance period, Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period, Four decades of research on the open-shop scheduling problem to minimize the makespan, Two-machine flow shop and open shop scheduling problems with a single maintenance window, A desired load distribution model for scheduling of unrelated parallel machines
Cites Work
- Unnamed Item
- Unnamed Item
- Machine scheduling with availability constraints
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem 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
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
- Open Shop Scheduling to Minimize Finish Time
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Short Shop Schedules
- An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity
- Dual criteria preemptive open-shop problems with minimum makespan
- Two-machine flow shops with limited machine availability
