A constraint programming approach for the resource-constrained project scheduling problem

A ‘pure’ Constraint Programming approach for the Resource-Constrained Project Scheduling Problem is presented. Our basic idea was to substitute the resource constraints by a set of ‘sub-constraints’ generated as needed. Each of these sub-constraints corresponds to a set of tasks that cannot be executed together without violating one of the resource constraints. A filtering algorithm for these sub-constraints has been developed. When applied to the initial resource constraints together with known filtering algorithms, this new filtering algorithm provides very good numerical results.