A note on posterior tight worst-case bounds for longest processing time schedules
LPT algorithm, Multiprocessor scheduling, Parallel machines, Worst case analysis
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. This note proposes and analyzes a posterior tight worst-case bound for the longest processing time (LPT) heuristic for scheduling independent jobs on identical parallel machines with the objective of minimizing the makespan. It makes natural remarks on the well-known posterior worst-case bounds, and shows that the proposed bound can complement the well-known posterior bounds to synergistically achieve a better posterior worst-case bound for the LPT heuristic. Moreover, it gives some insight on LPT asymptotical optimality.
Ho, Johnny C.; Massabò, Ivar; Paletta, Giuseppe; and Ruiz-Torres, Alex J., "A note on posterior tight worst-case bounds for longest processing time schedules" (2019). Faculty Bibliography. 2794.