The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays

Aurélien Carlier (), Claire Hanen () and Alix Munier Kordon ()
Additional contact information
Aurélien Carlier: Sorbonne Universités, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606
Claire Hanen: Sorbonne Universités, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606
Alix Munier Kordon: Sorbonne Universités, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606

Journal of Scheduling, 2017, vol. 20, issue 3, No 7, 303-311

Abstract: Abstract We consider a finite set of unit time execution tasks with release dates, due dates and precedence delays. The machines are partitioned into k classes. Each task requires one machine from a fixed class to be executed. The problem is the existence of a feasible schedule. This general problem is known to be $$\mathcal {NP}$$ NP -complete; many studies were devoted to the determination of polynomial time algorithms for some special subcases, most of them based on a particular list schedule. The Garey–Johnson and Leung–Palem–Pnueli algorithms (respectively GJ and LPP in short) are both improving the due dates to build a priority list. They are modifying them using necessary conditions until a fixed point is reached. The present paper shows that these two algorithms are different implementations of the same generic one. The main consequence is that all the results valid for GJ algorithm are also for LPP and vice versa.

Keywords: List scheduling algorithms; Polynomial subproblems; Approximation algorithms (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-016-0507-8 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:20:y:2017:i:3:d:10.1007_s10951-016-0507-8

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

DOI: 10.1007/s10951-016-0507-8

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