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