Linked Task Scheduling : Algorithms for the Single Machine Case - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4602.pdf (123.02 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071983 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071983 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More