Approximation algorithms for the multiprocessor open shop scheduling problem
From MaRDI portal
(Redirected from Publication:1306353)
Recommendations
Cites work
- Bounds on Multiprocessing Timing Anomalies
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Makespan minimization in open shops: A polynomial time approximation scheme
- Open Shop Scheduling to Minimize Finish Time
- Scheduling open shops with parallel machines
- Short Shop Schedules
- Worst-case analysis of heuristics for open shops with parallel machines
Cited in
(22)- 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
- Approximation algorithms for shop scheduling problems with minsum objective
- Large-scale medical examination scheduling technology based on intelligent optimization
- A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
- A linear time approximation scheme for makespan minimization in an open shop with release dates
- Approximation algorithms for parallel open shop scheduling
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- 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
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- A tabu search approach for proportionate multiprocessor open shop scheduling
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
- Flexible open shop scheduling problem to minimize makespan
- A new three-machine shop scheduling: complexity and approximation algorithm
- scientific article; zbMATH DE number 1500536 (Why is no real title available?)
- scientific article; zbMATH DE number 1396582 (Why is no real title available?)
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- Linear time approximation scheme for the multiprocessor open shop problem
- An efficient polynomial-time approximation scheme for parallel multi-stage open shops
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
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)
