A note on the Coffman–Sethi bound for LPT scheduling
- 177 Downloads
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.
KeywordsIdentical 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).
- 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
- Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2), 416–429.Google Scholar