DocumentCode :
1781600
Title :
Branch and price with constraint propagation for Resource Constrained Project Scheduling Problem
Author :
Moukrim, Aziz ; Quilliot, Alain ; Toussaint, Helene
Author_Institution :
HEUDYASIC Lab., Technol. Univ., Compiegne, France
fYear :
2014
fDate :
3-5 Nov. 2014
Firstpage :
164
Lastpage :
169
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.
Keywords :
constraint handling; scheduling; PSPLIB instances; RCPSP; branch; constraint propagation; exact algorithm; generic SCIP software; price; resource constrained project scheduling problem; Electronic mail; Inference algorithms; Parallel processing; Schedules; Scheduling; Search problems; Upper bound; Branch and Price; constraint propagation; interval order; project scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control, Decision and Information Technologies (CoDIT), 2014 International Conference on
Conference_Location :
Metz
Type :
conf
DOI :
10.1109/CoDIT.2014.6996887
Filename :
6996887
Link To Document :
بازگشت