Approximation algorithms for the multiprocessor open shop scheduling problem
From MaRDI portal
Publication:1306353
DOI10.1016/S0167-6377(99)00005-XzbMATH Open0967.90049MaRDI QIDQ1306353FDOQ1306353
Authors: P. Schuurman, Gerhard J. Woeginger 
Publication date: 3 September 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Bounds on Multiprocessing Timing Anomalies
- Open Shop Scheduling to Minimize Finish Time
- Short Shop Schedules
- Makespan minimization in open shops: A polynomial time approximation scheme
- Scheduling open shops with parallel machines
- Worst-case analysis of heuristics for open shops with parallel machines
Cited In (20)
- A tabu search approach for proportionate multiprocessor open shop scheduling
- Large-scale medical examination scheduling technology based on intelligent optimization
- A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
- Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- A linear time approximation scheme for makespan minimization in an open shop with release dates
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Linear time approximation scheme for the multiprocessor open shop problem
- Flexible open shop scheduling problem to minimize makespan
- Approximation algorithms for parallel open shop scheduling
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
- Approximation algorithms for shop scheduling problems with minsum objective
- A genetic algorithm for the proportionate multiprocessor open shop
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Two-stage open shop scheduling with a bottleneck machine
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- A new three-machine shop scheduling: complexity and approximation algorithm
- Title not available (Why is that?)
This page was built for publication: Approximation algorithms for the multiprocessor open shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306353)
