Insertion of a Random Task in a Schedule : a Real-Time Approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Insertion of a Random Task in a Schedule : a Real-Time Approach

Abstract

We consider the case of a single resource. A given schedule (possibly optimal) is evaluated by means of the sum of the delays of the tasks. A taskappears in the system at a random time. The duration of this task is random, as well as its due date. The goal is to complete the task at the latest by its due date while increasing as little as possible the sum of the delays of the initial tasks. We have to find an algorithm that reduces as most as possible the amount of computation to be performed in real time at the expenses of the amount of computation to be performed off-line.

Domains

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

Dates and versions

inria-00072429 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072429 , version 1

Cite

Cyril Duron, Jean-Marie Proth. Insertion of a Random Task in a Schedule : a Real-Time Approach. [Research Report] RR-4193, INRIA. 2001, pp.12. ⟨inria-00072429⟩
197 View
242 Download

Share

Gmail Facebook Twitter LinkedIn More