Branch and Price for Preemptive and Non Preemptive RCPSP Based on Interval Orders on Precedence Graphs - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2015

Branch and Price for Preemptive and Non Preemptive RCPSP Based on Interval Orders on Precedence Graphs

Résumé

This paper first describes an efficient exact algorithm to solve Preemptive RCPSP and next discusses its extension to Non Preemptive RCPSP. In case of Preemptive RCPSP, we propose a very original and efficient branch and bound/price procedure based upon minimal interval order enumeration, which is implemented with the help of the generic SCIP software. We perform tests on the famous PSPLIB instances which provide very satisfactory results. To the best of our knowledge it is the first algorithm able to solve at optimality all the set of j30 instances of PSPLIB in a preemptive way. The two last sections are devoted to the description of some heuristics, which also involve the interval order framework and the basic antichain linear program and which aim at handling larger scale RCPSP preemptive instances, and to a discussion of the way our algorithm may be extended to Non Preemptive RCPSP.
Fichier non déposé

Dates et versions

hal-01297269 , version 1 (03-04-2016)

Identifiants

Citer

Aziz Moukrim, Alain Quilliot, Hélène Toussaint. Branch and Price for Preemptive and Non Preemptive RCPSP Based on Interval Orders on Precedence Graphs. Recent Advances in Computational Optimization, 580, Springer International Publishing, pp.85-106, 2015, Studies in Computational Intelligence, 978-3-319-12630-2. ⟨10.1007/978-3-319-12631-9_6⟩. ⟨hal-01297269⟩
90 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More