Journal
JOURNAL OF SCHEDULING
Volume 12, Issue 4, Pages 389-400Publisher
SPRINGER
DOI: 10.1007/s10951-009-0101-4
Keywords
Scheduling; Parallel machines; UET tasks; Precedence constraints; Maximum lateness
Ask authors/readers for more resources
The Garey-Johnson algorithm is a well known polynomial-time algorithm constructing an optimal schedule for the maximum lateness problem with unit execution time tasks, two parallel identical processors, precedence constraints and release times. The paper is concerned with the worst-case analysis of a generalization of the Garey-Johnson algorithm to the case of arbitrary number of processors. In contrast to other algorithms for the maximum lateness problem, the tight performance guarantee for the even number of processors differs from the tight performance guarantee for the odd number of processors.
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