Minimizing the number of late jobs on unrelated machines

Authors:
Jianzhong Du;Joseph Y. -T Leung
Affiliations:
Computer Science Program, University of Texas at Dallas, Richardson, TX 75083, USA;Computer Science Program, University of Texas at Dallas, Richardson, TX 75083, USA
Venue:
Operations Research Letters
Year:
1991

Citing 2
Cited 1

On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Complexity of preemptive minsum scheduling on unrelated parallel machines

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of preemptively scheduling a set of independent jobs with release times on an arbitrary number of unrelated machines so as to minimize the number of late jobs. We show that the problem is NP-hard in the strong sense, giving the first strong NP-hardness result for this problem.