Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Project scheduling under resource constraints: Application of the cumulative global constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Trojet, M. ; UR MSSDT ESSTT, Tunis, Tunisia ; H'Mida, F. ; Lopez, P.

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.

Published in:

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Date of Conference:

6-9 July 2009