Title
A min-flow algorithm for Minimal Critical Set detection in Resource Constrained Project Scheduling
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.
Year
DOI
Venue
2013
10.1016/j.artint.2011.12.001
ICAPS
Keywords
DocType
Volume
min-flow algorithm,existing flow,minimal critical sets,precedence constraint posting method,better scalability,resource constrained project scheduling,mcs detection,minimal critical set detection,critical sets,mcs detection procedure,fundamental step,generalized precedence relation,constraint programming
Conference
182-183,
Issue
ISSN
Citations 
1
0004-3702
2
PageRank 
References 
Authors
0.41
13
2
Name
Order
Citations
PageRank
Michele Lombardi127028.86
Michela Milano2111797.67