Polynomial time approximation algorithms for proportionate open-shop scheduling
From MaRDI portal
Recommendations
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Approximation algorithms for parallel open shop scheduling
- scientific article; zbMATH DE number 1500536
- Approximation algorithms for the multiprocessor open shop scheduling problem
- Makespan minimization in open shops: A polynomial time approximation scheme
Cites work
- A genetic algorithm for the proportionate multiprocessor open shop
- A study of integer programming formulations for scheduling problems
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Comparative evaluation of MILP flowshop models
- Dense open-shop schedules with release times
- Focused Scheduling in Proportionate Flowshops
- How good is a dense shop schedule?
- scientific article; zbMATH DE number 4093162 (Why is no real title available?)
- scientific article; zbMATH DE number 1305102 (Why is no real title available?)
- scientific article; zbMATH DE number 3799380 (Why is no real title available?)
- Makespan minimization in open shops: A polynomial time approximation scheme
- New MILP models for the permutation flowshop problem
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- Open Shop Scheduling to Minimize Finish Time
- Open shop scheduling with machine dependent processing times
- Open-shop dense schedules: properties and worst-case performance ratio
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Short Shop Schedules
- The distributed permutation flowshop scheduling problem
Cited in
(14)- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Makespan minimization in open shops: A polynomial time approximation scheme
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem
- A polynomial-time open-shop problem with an arbitrary number of machines
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- Some positive news on the proportionate open shop problem
- The LPT heuristic for minimizing total load on a proportionate openshop
- Approximation algorithms for two-machine proportionate routing open shop on a tree
- On the complexity of proportionate open shop and job shop problems
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
This page was built for publication: Polynomial time approximation algorithms for proportionate open-shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5246814)
