Journal
JOURNAL OF SCHEDULING
Volume 19, Issue 6, Pages 729-736Publisher
SPRINGER
DOI: 10.1007/s10951-015-0464-7
Keywords
Online and offline scheduling; Identical parallel machines; Late work; NP-hardness; Competitive ratio
Ask authors/readers for more resources
In the paper, we consider the problem of scheduling jobs on parallel identical machines with the late work criterion and a common due date, both offline and online cases. Since the late work criterion has not been studied in the online mode so far, the analysis of the online problem is preceded by the analysis of the offline problem, whose complexity status has not been formally stated in the literature yet. Namely, for the offline mode, we prove that the two-machine problem is binary NP-hard, and the general case is unary NP-hard. In the online mode we assume that jobs arrive in the system one by one, i.e., we consider the online over list model. We give an algorithm with a competitive ratio being a function of the number of machines, and we prove the optimality of this approach for two identical machines.
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