A polynomial-time open-shop problem with an arbitrary number of machines
From MaRDI portal
Publication:1816373
DOI10.1007/BF01291296zbMath0875.90320MaRDI QIDQ1816373
Publication date: 20 January 1997
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Related Items (5)
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 ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Open block scheduling in optical communication networks
Cites Work
This page was built for publication: A polynomial-time open-shop problem with an arbitrary number of machines
