The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays - Archive ouverte HAL Access content directly
Journal Articles Journal of Scheduling Year : 2017

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.
Fichier principal
Vignette du fichier
Carlier_2017_The_equivalence_of.pdf (206.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01472060 , version 1 (20-02-2017)

Identifiers

Cite

Aurélien Carlier, Claire C. 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, 2017, pp.1-9. ⟨10.1007/s10951-016-0507-8⟩. ⟨hal-01472060⟩
203 View
217 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More