Approximation Algorithms for Three-Machine Open Shop Scheduling
From MaRDI portal
Recommendations
- A greedy open shop heuristic with job priorities
- Approximation algorithms for parallel open shop scheduling
- A 3/2 algorithm for two-machine open shop with route-dependent processing times
- scientific article; zbMATH DE number 1053659
- A polynomial algorithm for the three-machine open shop with a bottleneck machine
Cited in
(31)- A greedy open shop heuristic with job priorities
- Makespan minimization in open shops: A polynomial time approximation scheme
- Worst-case analysis of heuristics for open shops with parallel machines
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- A hybrid genetic algorithm for the open shop scheduling problem
- Two-stage open shop scheduling with a bottleneck machine
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- A 3/2 algorithm for two-machine open shop with route-dependent processing times
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- An approximation algorithm for scheduling on three dedicated machines
- Approximation algorithms for parallel open shop scheduling
- A polynomial algorithm for the three-machine open shop with a bottleneck machine
- Three-machine open shop with a bottleneck machine revisited
- 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
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Approximation algorithms for the three-machine proportionate mixed shop scheduling
- Open-shop dense schedules: properties and worst-case performance ratio
- A tabu search approach for proportionate multiprocessor open shop scheduling
- A modification to the CGPS algorithm for three-machine flow shop scheduling
- The three-machine proportionate open shop and mixed shop minimum makespan problems
- The open shop scheduling problem
- Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
- A new three-machine shop scheduling: complexity and approximation algorithm
- scientific article; zbMATH DE number 33165 (Why is no real title available?)
- scientific article; zbMATH DE number 1053659 (Why is no real title available?)
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- How good is a dense shop schedule?
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- Dense open-shop schedules with release times
This page was built for publication: Approximation Algorithms for Three-Machine Open Shop Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4282281)
