Branch and price with constraint propagation for Resource Constrained Project Scheduling Problem - Archive ouverte HAL
Communication Dans Un Congrès Année : 2015

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01121869 , version 1 (02-03-2015)

Identifiants

Citer

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⟩
164 Consultations
0 Téléchargements

Altmetric

Partager

More