Branch and price with constraint propagation for Resource Constrained Project Scheduling Problem

Aziz Moukrim (1) , Alain Quilliot (2) , Hélène Toussaint (2)

1 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes

This paper describes an efficient exact algorithm to solve the Resource Constrained Project Scheduling Problem (RCPSP). We propose an original and efficient branch and price procedure which involves minimal interval order enumeration as well as constraint propagation and which is implemented with the help of the generic SCIP software. We perform tests on the famous PSPLIB instances which provide very satisfactory results.

Mots clés: Branch and Price; constraint propagation; interval order; project scheduling

Domaines: Recherche opérationnelle [math.OC]

Aziz Moukrim, Alain Quilliot, Hélène Toussaint. Branch and price with constraint propagation for Resource Constrained Project Scheduling Problem. International Conference on Control, Decision and Information Technologies (CoDIT), Nov 2014, Metz, France. pp.164 - 169, ⟨10.1109/CoDIT.2014.6996887⟩. ⟨hal-01121869⟩