Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines

Authors:
René Sitters
Affiliations:
-
Venue:
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2001

Citing 4
Cited 3

Minimizing mean flow time with release time constraint

Theoretical Computer Science
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Scheduling chain-structured tasks to minimize makespan and mean flow time

Information and Computation

Faster algorithms for semi-matching problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
How useful are preemptive schedules?

Operations Research Letters
Reoptimization of the minimum total flow-time scheduling problem

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.