Skip to main content
Conference Proceedings

Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2081 396-405
DOI: 10.1007/3-540-45535-3_31
18Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Sitters, R. (2001). Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2081, pp. 396–405). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free