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

Abstract : 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.
Type de document :
Article dans une revue
INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2005, 17 (1), pp.52-65. 〈10.1287/ijoc.1030.0043〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01980644
Contributeur : Sophie Demassey <>
Soumis le : mardi 5 février 2019 - 15:33:53
Dernière modification le : jeudi 7 février 2019 - 15:33:01

Fichier

demassey03ijc_pre4hal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Sophie Demassey, Christian Artigues, Philippe Michelon. Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem. INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2005, 17 (1), pp.52-65. 〈10.1287/ijoc.1030.0043〉. 〈hal-01980644〉

Partager

Métriques

Consultations de la notice

37

Téléchargements de fichiers

6