A polynomial algorithm for the three-machine open shop with a bottleneck machine
From MaRDI portal
Publication:1960318
DOI10.1023/A:1018982630730zbMath0931.90020OpenAlexW1558176464MaRDI QIDQ1960318
Vitaly A. Strusevich, Inna G. Drobouchevitch
Publication date: 11 January 2000
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018982630730
Related Items (7)
Some positive news on the proportionate open shop problem ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Open-shop dense schedules: properties and worst-case performance ratio ⋮ A complete 4-parametric complexity classification of short shop scheduling problems ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Three-machine open shop with a bottleneck machine revisited ⋮ Two-stage open shop scheduling with a bottleneck machine
This page was built for publication: A polynomial algorithm for the three-machine open shop with a bottleneck machine
