Title of article :
A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
Author/Authors :
A. A. Gladky، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1997
Keywords :
Preemptive openshop scheduling , NP-hardness , Mean flow time
Journal title :
European Journal of Operational Research
Journal title :
European Journal of Operational Research
