The worst-case analysis of the Garey-Johnson algorithm

Publication Type:
Journal Article
Journal Of Scheduling, 2009, 12 (4), pp. 389 - 400
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2008007805OK.pdf556.82 kB
Adobe PDF
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.
Please use this identifier to cite or link to this item: