Journal
MATHEMATICAL PROGRAMMING
Volume 94, Issue 2-3, Pages 361-374Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-002-0324-z
Keywords
scheduling; preemption; approximation algorithm; worst case ratio; computational complexity; in-approximability
Ask authors/readers for more resources
We consider the problem of preemptively scheduling a set of n jobs on in (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining jobs so as to optimize the preemptive makespan on the in machines plus the sum of the penalties of the jobs rejected. We provide a complete classification of these scheduling problems with respect to complexity and approximability. Our main results are on the variant with an arbitrary number of unrelated machines. This variant is APX-hard, and we design a 1.58-approximation algorithm for it. All other considered variants are weakly NP-hard, and we provide fully polynomial time approximation schemes for them. Finally, we argue that our results for unrelated machines can be carried over to the corresponding preemptive open shop scheduling problem with rejection.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available