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

Authors:
Michele Lombardi;Michela Milano
Affiliations:
DEIS Universití di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy;DEIS Universití di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
Venue:
Artificial Intelligence
Year:
2012

Citing 11
Cited 1

Scheduling project networks with resource constraints and time windows

Annals of Operations Research
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Maximum independent sets on transitive graphs and their applications in testing and CAD

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Constraint-Based Scheduling

Constraint-Based Scheduling
A Constraint-Based Method for Project Scheduling with Time Windows

Journal of Heuristics
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
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

CROSS cyclic resource-constrained scheduling solver

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a min-flow algorithm for detecting Minimal Critical Sets (MCS) in Resource Constrained Project Scheduling Problems (RCPSP). The MCS detection is a fundamental step in the Precedence Constraint Posting method (PCP), one of the most successful approaches for the RCPSP. The proposed approach is considerably simpler compared to existing flow based MCS detection procedures and has better scalability compared to enumeration- and envelope-based ones, while still providing good quality Critical Sets. The method is suitable for problem variants with generalized precedence relations or uncertain/variable durations.