A min-flow algorithm for minimal critical set detection in resource constrained project scheduling

Publication year: 2011 Source: Artificial Intelligence, Available online 9 December 2011 Michele Lombardi, Michela Milano 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

Publication year: 2011 Source: Artificial Intelligence, Available online 9 December 2011 Michele Lombardi, Michela Milano 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

Read the original:
A min-flow algorithm for minimal critical set detection in resource constrained project scheduling