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.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01980644
Contributor : Sophie Demassey <>
Submitted on : Tuesday, February 5, 2019 - 3:33:53 PM
Last modification on : Friday, June 14, 2019 - 6:31:22 PM
Long-term archiving on : Monday, May 6, 2019 - 12:17:50 PM

File

demassey03ijc_pre4hal.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

82

Files downloads

95