Branch-and-Cut-and-Price algorithms for the preemptive RCPSP - Archive ouverte HAL Access content directly
Journal Articles RAIRO - Operations Research Year : 2018

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


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.
Fichier principal
Vignette du fichier
ro170270.pdf (458.93 Ko) Télécharger le fichier
Origin : Publication funded by an institution

Dates and versions

hal-02024839 , version 1 (29-08-2020)



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



Gmail Facebook Twitter LinkedIn More