A precedence constraint posting approach for the RCPSP with time lags and variable durations

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

Citing 7
Cited 4

Computing the Envelope for Stepwise-Constant Resource Allocations

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
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
Temporal dynamic controllability revisited

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
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
Robust non-preemptive hard real-time scheduling for clustered multicore platforms

Proceedings of the Conference on Design, Automation and Test in Europe

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

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Optimal methods for resource allocation and scheduling: a cross-disciplinary survey

Constraints
A min-flow algorithm for Minimal Critical Set detection in Resource Constrained Project Scheduling

Artificial Intelligence
Robust local search for solving RCPSP/max with durational uncertainty

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Resource Constrained Project Scheduling Problem is a very important problem in project management, manufacturing and resource optimization. We focus on a variant of RCPSP with time lags and variable activity durations. The solving approach is based on Precedence Constraint Posting that adds new precedence constraints to the original project graph so that all resource conflicts are solved and a consistent assignment of start times can be computed for whatever combination of activity durations. We propose a novel method for computing resource conflicts based on the minimum flow on the resource graph and we use it in an efficient complete search strategy. We experiment the approach on instances coming from the scheduling of parallel applications on multi processor systems on chip.