Skip to Main content Skip to Navigation
Reports

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

Abstract : We consider a set of tasks defined by their duration and their due-date. They are performed by a single resource and scheduled in order to minimize the sum of the delays. This schedule is given. A task appears in the system at time 0. It is made of two subtasks separated by a fixed period. The duration of the two subtasks and of the period are known only when the task appears. It is also the case for the due date that cannot be violated. The goal is to insert this random task in the schedule while increasing as less as possible the criterion of the initial schedule, that is the sum of the delays. The main difficulty is to insert the task in real-time, which implies that the proposed method should manage to make most of the computation off-line.
Document type :
Reports
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072250
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 8:13:35 PM
Last modification on : Thursday, February 11, 2021 - 2:48:12 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:00:36 PM

Identifiers

  • HAL Id : inria-00072250, version 1

Collections

Citation

Cyril Duron, Jean-Marie Proth, Yorai Wardi. Insertion of a Random Bitask in a Schedule: a Real-Time Approach. [Research Report] RR-4337, INRIA. 2001, pp.20. ⟨inria-00072250⟩

Share

Metrics

Record views

156

Files downloads

230