The worst-case analysis of the Garey---Johnson algorithm

  • Authors:

  • Claire Hanen;Yakov Zinder

  • Affiliations:

  • LIP6, Université Pierre et Marie Curie and Université Paris Ouest-Nanterre-La défense, Paris, France;Department of Mathematics, Faculty of Science, University of Technology, Sydney, Australia

  • Venue:
  • Journal of Scheduling
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.