Citation
Walk the (Time-)Line: Scheduling and Execution. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 23-23, 2007.
Paper
Abstract
At its core, a project scheduling problem consists in synthesizing functions that represent availability of resources over time (resource timelines) which are consistent with both resource bounds and temporal constraints specified in the problem. This talk begins with a review of the artificial intelligence constraint-based approach to project scheduling, also referred to as precedence-constraint posting. This approach is based on the ability to solve the problem by reasoning on the representation of temporal constraints and, on top of it, of resource timelines and their current contention peaks. The talk will then introduce the complementary problem of schedule execution under uncertainty, where the same type of reasoning can be used to obtain schedules which are resilient to execution-time contingencies. Here, two types of solutions are distinguished, namely flexible and partial order schedules, which lead to timelines with different degrees of robustness with respect to unexpected variations at execution time. A third part of this talk will be dedicated to a survey of recent developments of our work, including relevant applications of the presented techniques in the context of space applications
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-023-023-P, author = {A. Cesta},
title = {Walk the (Time-)Line: Scheduling and Execution},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {23--23},
note = {Paper},
abstract = {At its core, a project scheduling problem consists in synthesizing functions that represent availability of resources over time (resource timelines) which are consistent with both resource bounds and temporal constraints specified in the problem. This talk begins with a review of the artificial intelligence constraint-based approach to project scheduling, also referred to as precedence-constraint posting. This approach is based on the ability to solve the problem by reasoning on the representation of temporal constraints and, on top of it, of resource timelines and their current contention peaks. The talk will then introduce the complementary problem of schedule execution under uncertainty, where the same type of reasoning can be used to obtain schedules which are resilient to execution-time contingencies. Here, two types of solutions are distinguished, namely flexible and partial order schedules, which lead to timelines with different degrees of robustness with respect to unexpected variations at execution time. A third part of this talk will be dedicated to a survey of recent developments of our work, including relevant applications of the presented techniques in the context of space applications},
owner = {kzzgrk},
timestamp = {2012.05.21},
webpdf = {2007-023-023-P.pdf} }