Title of article :
Complexity of preemptive minsum scheduling on unrelated parallel machines
Author/Authors :
Rene Sitters، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Pages :
12
From page :
37
To page :
48
Keywords :
NP-hard , Scheduling , preemption , Total completion time
Journal title :
Journal of Algorithms
Serial Year :
2005
Journal title :
Journal of Algorithms
Record number :
291680
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=291680
