Title of article :
An open shop scheduling problem with a non-bottleneck machine
Author/Authors :
V. A. Strusevich، نويسنده , , L. A. Hall، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1997
Keywords :
complexity , worst-case analysis , approximation , Dynamic Programming , Fully polynomial approximation scheme , Open shop
Journal title :
Operations Research Letters
Journal title :
Operations Research Letters
