Journal of Scheduling

, Volume 18, Issue 3, pp 325–327 | Cite as

A note on the Coffman–Sethi bound for LPT scheduling

  • James D. BlocherEmail author
  • Sergey Sevastyanov


Makespan minimization on a set of parallel machines is one of the most widely studied problems in scheduling theory. A new result is presented which improves on the classical Coffman–Sethi a posteriori bound on the relative error of the LPT algorithm. It is shown that the ratio of these two bounds (the old one to the new one) can be arbitrarily large.


Identical parallel machines Makespan minimization  LPT algorithm Coffman–Sethi Scheduling 



Research by the second author was supported by the Russian Foundation for Humanities (Grant No. 13-22-10002).


  1. Chen, B. (1993). A note on LPT scheduling. Operations Research Letters, 14, 139–142.CrossRefGoogle Scholar
  2. Coffman, E. G., & Sethi, R. (1976). A generalized bound on LPT sequencing. Revue Francaise d’ Automatique Informatique, Recherche Operationnelle Supplement, 10, 17–25.Google Scholar
  3. Garey, M. R., & Johnson, D. S. (1978). Strong NP-completeness results: Motivation, examples and implications. Journal of the Association for Computing Machinery, 25, 499–508.CrossRefGoogle Scholar
  4. Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2), 416–429.Google Scholar
  5. Pinedo, M. (2012). Scheduling: Theory, algorithms and systems (4th ed.). New York, NY: Springer.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Kelley School of BusinessIndiana UniversityBloomingtonUSA
  2. 2.Sobolev Institute of MathematicsNovosibirsk State UniversityNovosibirskRussia

Personalised recommendations