Branch-and-Cut-and-Price algorithms for the preemptive RCPSP

Abstract : In this article, we address the preemptive Resource-Constrained Precedence Scheduling Problem. We propose two mixed integer formulations containing an exponential number of variables and inequalities. An antichain is a set of pairwise incomparable elements with respect to the precedence constraints. In the first formulation, the integer variables are associated with the antichains. For the second, the integer variables are limited to a particular subset of antichains. We propose two Branch-and-Cut-and-Price algorithms for each of these formulations. We introduce some valid inequalities in order to reinforce the second formulation. Finally, we give some computational results on instances of the PSPLIB and compare the formulations.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02024839
Contributor : Hélène Toussaint <>
Submitted on : Tuesday, February 19, 2019 - 1:38:05 PM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM

Links full text

Identifiers

Citation

Pierre Fouilhoux, A.Ridha Mahjoub, Alain Quilliot, Hélène Toussaint. Branch-and-Cut-and-Price algorithms for the preemptive RCPSP. RAIRO - Operations Research, EDP Sciences, 2018, 52 (2), pp.513-528. ⟨10.1051/ro/2018031⟩. ⟨hal-02024839⟩

Share

Metrics

Record views

41