When difference in machine loads leads to efficient scheduling in open shops
From MaRDI portal
Publication:1960320
DOI10.1023/A:1018986731638zbMath0958.90040MaRDI QIDQ1960320
Ilya Tchernykh, Sergey Sevast'janov, Alexander V. Kononov
Publication date: 11 January 2000
Published in: Annals of Operations Research (Search for Journal in Brave)
schedulingschedulepolynomial-time algorithmpolynomial-time algorithmsopen shop problemopen shopsmachine load
Related Items
Some positive news on the proportionate open shop problem ⋮ Exponential tightness for integral-type functionals of centered independent differently distributed random variables ⋮ The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass ⋮ The multi-stripe travelling salesman problem ⋮ Open-shop dense schedules: properties and worst-case performance ratio ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop
