Skip to Main content Skip to Navigation

Linked Task Scheduling : Algorithms for the Single Machine Case

Abstract : We consider a system made of one resource. The execution of the tasks is non-preemptive on this resource. The tasks we consider are composed of a given number of subtasks, two consecutives subtasks being separated by an idle period. These idle periods may be used for executing other subtasks. We wish to insert a new task in a given schedule. The characteristics of this task are not known before it appears, and its execution must be completed before a given deadline. The criterion is the minimization of the increase of the sum of the delays of the tasks.
Document type :
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:25:00 PM
Last modification on : Friday, February 4, 2022 - 3:23:55 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:47:33 PM


  • HAL Id : inria-00071983, version 1



Cyril Duron, Jean-Marie Proth. Linked Task Scheduling : Algorithms for the Single Machine Case. [Research Report] RR-4602, INRIA. 2002, pp.12. ⟨inria-00071983⟩



Record views


Files downloads