Constraint based scheduling to deal with uncertain durations and self-timed execution

Authors:
Michele Lombardi;Michela Milano
Affiliations:
DEIS, Università di Bologna, Bologna, Italy;DEIS, Università di Bologna, Bologna, Italy
Venue:
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Year:
2010

Citing 8
Cited 0

Constraint-Based Scheduling

Constraint-Based Scheduling
Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results

Artificial Intelligence
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling

AI Communications - Constraint Programming for Planning and Scheduling
A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Dynamic control of plans with temporal uncertainty

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Complete MCS-based search: application to resource constrained project scheduling

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A precedence constraint posting approach for the RCPSP with time lags and variable durations

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose off-line and on-line extensions to the Resource Constrained Project Scheduling Problem. The off-line extension is a variant of RCPSP with time lags and uncertain, bounded activity durations. In this context we improve over our previous work presented in [12] by proposing an incremental flow computation for finding minimal conflict sets and a set of filtering rules for cumulative constraint propagation. The on-line extension is based instead on considering an on-line semantics such as the Self-Timed Execution and take it into account in the scheduling process. Adding the on-line aspect to the problem makes the CSP framework no longer suitable. We have extended the CSP framework to take into account general search decisions and auxiliary unbound variables. An extensive set of experimental results show an improvement of up to two orders of magnitude over our previous approach.