Title of article
An open shop scheduling problem with a non-bottleneck machine
Author/Authors
V. A. Strusevich، نويسنده , , L. A. Hall، نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1997
Pages
8
From page
11
To page
18
Keywords
complexity , worst-case analysis , approximation , Dynamic Programming , Fully polynomial approximation scheme , Open shop
Journal title
Operations Research Letters
Serial Year
1997
Journal title
Operations Research Letters
Record number
137071
Link To Document