Title of article
A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
Author/Authors
A. A. Gladky، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
4
From page
113
To page
116
Keywords
Preemptive openshop scheduling , NP-hardness , Mean flow time
Journal title
European Journal of Operational Research
Serial Year
1997
Journal title
European Journal of Operational Research
Record number
212293
Link To Document