A note on LPT scheduling

  • Authors:

  • Bo Chen

  • Affiliations:

  • Econometric Institute, Erasmus University, Rotterdam, The Netherlands

  • Venue:
  • Operations Research Letters
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the theory of parallel-machine scheduling, the Largest Processing-Time-first (LPT) heuristic has been the touchstone for the design of efficient off-line algorithms. In this note, a new property of the LPT schedules is explored. As a result, Graham's bound of 43 - 1/(3m) (Graham, 1969) and the generalized bound (Coffman and Sethi, 1976) for the performance of LPT heuristic is readily obtained from this property. This note also corrects a flaw in the latter bound in Coffman and Sethi (1976).