Skip to Main content Skip to Navigation
New interface
Reports (Research report)

The worst case analysis of the Garey-Johnson algorithm

Claire Hanen 1 Yakov Zinder 
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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 generalisation 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.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Friday, April 17, 2020 - 3:44:18 PM
Last modification on : Wednesday, October 26, 2022 - 8:15:41 AM


Files produced by the author(s)


  • HAL Id : hal-02545977, version 1


Claire Hanen, Yakov Zinder. The worst case analysis of the Garey-Johnson algorithm. [Research Report] lip6.2008.002, LIP6. 2008. ⟨hal-02545977⟩



Record views


Files downloads