A 3/2 algorithm for two-machine open shop with route-dependent processing times
From MaRDI portal
Publication:1806706
DOI10.1023/A:1009643112214zbMath0940.68009MaRDI QIDQ1806706
Vitaly A. Strusevich, A. J. A. van de Waart, Rommert Dekker
Publication date: 8 November 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Related Items (2)
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
This page was built for publication: A 3/2 algorithm for two-machine open shop with route-dependent processing times
