A note on the Coffman–Sethi bound for LPT scheduling

A note on the Coffman–Sethi bound for LPT scheduling

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 (...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of scheduling 2015-06, Vol.18 (3), p.325-327
Hauptverfasser: Blocher, James D., Sevastyanov, Sergey
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control
Optimization
Job shops
Operations Research/Decision Theory
Optimization
Production scheduling
Schedules
Scheduling
Studies
Supply Chain Management
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-015-0419-z