Three is easy, two is hard: Open shop sum-batch scheduling problem refined
From MaRDI portal
Publication:2466597
DOI10.1016/j.orl.2005.07.006zbMath1133.90339OpenAlexW1987105744MaRDI QIDQ2466597
Dominique de Werra, Vitaly A. Strusevich, Chung-Yee Lee, Irina Gribkovskaia
Publication date: 15 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.07.006
Related Items (5)
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 ⋮ Minimizing makespan for multi-spindle head machines with a mobile table ⋮ Transporting jobs through a two‐machine open shop ⋮ A cyclical search for the two machine flow shop and open shop to minimise finishing time
Uses Software
Cites Work
This page was built for publication: Three is easy, two is hard: Open shop sum-batch scheduling problem refined