Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem - Université Toulouse 3 Accéder directement au contenu
Article Dans Une Revue INFORMS Journal on Computing Année : 2005

Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem

Résumé

W e propose a cooperation method between constraint programming and integer programming to compute lower bounds for the resource-constrained project scheduling problem (RCPSP). The lower bounds are evaluated through linear-programming (LP) relaxations of two different integer linear formulations. Efficient resource-constraint propagation algorithms serve as a preprocessing technique for these relaxations. The originality of our approach is to use additionally some deductions performed by constraint propagation, and particularly by the shaving technique, to derive new cutting planes that strengthen the linear programs. Such new valid linear inequalities are given in this paper, as well as a computational analysis of our approach. Through this analysis, we also compare the two considered linear formulations for the RCPSP and confirm the efficiency of lower bounds computed in a destructive way.
Fichier principal
Vignette du fichier
demassey03ijc_pre4hal.pdf (330.38 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01980644 , version 1 (05-02-2019)

Identifiants

Citer

Sophie Demassey, Christian Artigues, Philippe Michelon. Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem. INFORMS Journal on Computing, 2005, 17 (1), pp.52-65. ⟨10.1287/ijoc.1030.0043⟩. ⟨hal-01980644⟩
111 Consultations
270 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More