A note on posterior tight worst-case bounds for longest processing time schedules

Johnny C. Ho (), Ivar Massabò (), Giuseppe Paletta () and Alex J. Ruiz-Torres ()
Additional contact information
Johnny C. Ho: Columbus State University
Ivar Massabò: Università della Calabria
Giuseppe Paletta: Università della Calabria
Alex J. Ruiz-Torres: Universidad de Puerto Rico - Rio Piedras

4OR, 2019, vol. 17, issue 1, No 4, 97-107

Abstract: Abstract 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.

Keywords: Multiprocessor scheduling; Parallel machines; LPT algorithm; Worst case analysis; 68W25; 90C27; 90C59 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10288-018-0381-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:aqjoor:v:17:y:2019:i:1:d:10.1007_s10288-018-0381-7

Ordering information: This journal article can be ordered from
https://www.springer ... ch/journal/10288/PSE

DOI: 10.1007/s10288-018-0381-7

Access Statistics for this article

4OR is currently edited by Yves Crama, Michel Grabisch and Silvano Martello

More articles in 4OR from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().