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

Abstract : We consider a finite set of unit time execution tasks with release dates, due dates and precedence delays. The machines are partitionned 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 N P-complete; many studies were devoted to the determination of polynomial time algorithms for some special subcasses, 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 modifiying them using necessary conditions until a fix point is reached. The present paper shows that these two algorithms are different implementations of a same generic one. The main consequence is that all the results valid for GJ algorithm, are also for LPP and vice versa.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01472060
Contributor : Gestionnaire Hal-Upmc <>
Submitted on : Monday, February 20, 2017 - 3:03:00 PM
Last modification on : Thursday, March 21, 2019 - 2:54:22 PM
Document(s) archivé(s) le : Sunday, May 21, 2017 - 2:16:27 PM

File

Carlier_2017_The_equivalence_o...
Files produced by the author(s)

Identifiers

Citation

Aurélien Carlier, Claire Hanen, Alix Munier-Kordon. The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays. Journal of Scheduling, Springer Verlag, 2017, pp.1-9. ⟨10.1007/s10951-016-0507-8⟩. ⟨hal-01472060⟩

Share

Metrics

Record views

209

Files downloads

59