Some positive news on the proportionate open shop problem
From MaRDI portal
Publication:2633607
Recommendations
- A new lower bound for the open-shop problem
- On the set of solutions of the open shop problem
- Publication:4888938
- scientific article; zbMATH DE number 432988
- Stochastic Algorithms: Foundations and Applications
- Open shops with jobs overlap -- revisited
- scientific article; zbMATH DE number 4170627
- A Position-Based Propagator for the Open-Shop Problem
- scientific article; zbMATH DE number 3984949
- A note on the complexity of the concurrent open shop problem
Cites work
- scientific article; zbMATH DE number 22820 (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?)
- A polynomial algorithm for the three-machine open shop with a bottleneck machine
- A polynomial-time open-shop problem with an arbitrary number of machines
- An Algorithm for the Open-Shop Problem
- Linear time approximation scheme for the multiprocessor open shop problem
- Makespan minimization in open shops: A polynomial time approximation scheme
- Nonstrict vector summation in multi-operation scheduling
- Open Shop Scheduling to Minimize Finish Time
- Open shop scheduling with maximal machines
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- Scheduling ordered open shops
- The three-machine proportionate open shop and mixed shop minimum makespan problems
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
- When difference in machine loads leads to efficient scheduling in open shops
Cited in
(9)- On the complexity of proportionate open shop and job shop problems
- Approximation algorithms for two-machine proportionate routing open shop on a tree
- Approximation algorithms and a hardness result for the three-machine proportionate mixed shop
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- The three-machine proportionate open shop and mixed shop minimum makespan problems
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables
This page was built for publication: Some positive news on the proportionate open shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633607)