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 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01185248
Contributor : Lip6 Publications <>
Submitted on : Sunday, May 13, 2018 - 9:23:26 AM
Last modification on : Thursday, March 21, 2019 - 2:54:21 PM
Long-term archiving on: Tuesday, September 25, 2018 - 10:16:02 PM

File

GJHanenZinderJOS.pdf
Files produced by the author(s)

Identifiers

Citation

Claire Hanen, Yakov Zinder. The worst-case analysis of the Garey-Johnson Algorithm. Journal of Scheduling, Springer Verlag, 2009, 12 (4), pp.389-400. ⟨10.1007/s10951-009-0101-4⟩. ⟨hal-01185248⟩

Share

Metrics

Record views

110

Files downloads

104