A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem

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

Journal of Scheduling, 2016, vol. 19, issue 2, No 7, 207-211

Abstract: Abstract This note considers the longest processing time heuristic for scheduling n independent jobs on two uniform parallel machines to minimize the makespan. A posterior worst-case performance ratio, by depending on the index of the latest job inserted in the machine where the makespan takes place, is developed for this heuristic, and some examples demonstrate that the ratio is tight.

Keywords: Scheduling; Two uniform parallel machines; LPT schedule; Heuristic (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-015-0453-x 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:jsched:v:19:y:2016:i:2:d:10.1007_s10951-015-0453-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-015-0453-x

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

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