Title of article
Complexity of mixed shop scheduling problems: A survey
Author/Authors
Natalia V. Shakhlevich، نويسنده , , Yuri N. Sotskov، نويسنده , , Frank Werner، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
9
From page
343
To page
351
Keywords
optimal scheduling , Mixture of job and open shops , Polynomial algorithm , NP-hard problem
Journal title
European Journal of Operational Research
Serial Year
2000
Journal title
European Journal of Operational Research
Record number
213152
Link To Document