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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01121869
Contributor : Sohaib Afifi <>
Submitted on : Monday, March 2, 2015 - 4:53:19 PM
Last modification on : Monday, January 20, 2020 - 12:12:05 PM

Identifiers

Citation

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⟩

Share

Metrics

Record views

281