Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072429
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 9:56:26 AM
Last modification on : Thursday, February 11, 2021 - 2:48:12 PM
Long-term archiving on: : Sunday, April 4, 2010 - 8:41:03 PM

Identifiers

  • HAL Id : inria-00072429, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

334

Files downloads

391