TY - GEN
T1 - Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines
AU - Sitters, Renè
PY - 2001
Y1 - 2001
N2 - We show that the problems of minimizing total completion time and of minimizing the number of late jobs on unrelated parallel machines, when preemption is allowed, are both NP-hard in the strong sense. The former result settles a long-standing open question.
AB - We show that the problems of minimizing total completion time and of minimizing the number of late jobs on unrelated parallel machines, when preemption is allowed, are both NP-hard in the strong sense. The former result settles a long-standing open question.
UR - http://www.scopus.com/inward/record.url?scp=84947265087&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84947265087&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84947265087
SN - 3540422250
SN - 9783540422259
VL - 2081
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 396
EP - 405
BT - Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings
PB - Springer/Verlag
T2 - 8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001
Y2 - 13 June 2001 through 15 June 2001
ER -
