The Longest Processing Time rule for identical parallel machines revisited

Federico Della Croce () and Rosario Scatamacchia ()
Additional contact information
Federico Della Croce: Politecnico di Torino
Rosario Scatamacchia: Politecnico di Torino

Journal of Scheduling, 2020, vol. 23, issue 2, No 2, 163-176

Abstract: Abstract We consider the $$P_m || C_{\max }$$Pm||Cmax scheduling problem where the goal is to schedule n jobs on m identical parallel machines $$(m

Keywords: Identical parallel machine scheduling; LPT rule; Linear programming; Approximation algorithms (search for similar items in EconPapers)
Date: 2020
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-018-0597-6 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:23:y:2020:i:2:d:10.1007_s10951-018-0597-6

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

DOI: 10.1007/s10951-018-0597-6

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