Project Scheduling Under Resource Constraints: Application of the Cumulative Global Constraint in a Decision Support Framework
Résumé
This paper concerns project scheduling under resource constraints. Traditionally, the objective is to find a unique solution that minimizes the project makespan, while respecting the precedence constraints and the resource constraints. This work focuses on developing a model and a decision support framework for industrial application of the cumulative global constraint. For a given project scheduling, the proposed approach allows the generation of different optimal solutions relative to the alternate availability of outsourcing and resources. The objective is to provide a decision-maker an assistance to construct, choose, and define the appropriate scheduling program taking into account the possible capacity resources. The industrial problem under consideration is modeled as a Constraint Satisfaction Problem (CSP). It is implemented under the constraint programming language CHIP V5. 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.
Fichier principal
Scheduling_Under_Ressource_Constraints_Special_Issue_CIE39.pdf (151.91 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...