Two-stage open shop scheduling with a bottleneck machine
From MaRDI portal
Publication:1592745
DOI10.1016/S0377-2217(99)00356-2zbMath0982.90068MaRDI QIDQ1592745
Vitaly A. Strusevich, Inna G. Drobouchevitch
Publication date: 25 January 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
65Y20: Complexity and performance of numerical algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems
- Makespan minimization in open shops: A polynomial time approximation scheme
- Approximation algorithms for the multiprocessor open shop scheduling problem
- Worst-case analysis of heuristics for open shops with parallel machines
- An open shop scheduling problem with a non-bottleneck machine
- A polynomial algorithm for the three-machine open shop with a bottleneck machine
- Open Shop Scheduling to Minimize Finish Time
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Short Shop Schedules