Skip to Main Content
This paper concerns project scheduling under resource constraints. The objective is to find a solution that minimizes the project makespan, while respecting the precedence constraints and the resource constraints. The problem under consideration is modelled as a constraint satisfaction problem (CSP). It is implemented under the constraint programming language CHIP V5. For modelling the resource constraints, we are particularly interested in the application of the cumulative global constraint. The provided solutions determine values for the various variables associated to the tasks realized on each resource, as well as the curves with the profile of the total consumption of resources on time.