MATHEMATICAL FORMULATION AND APPROXIMATE METHODS FOR AN EXTENSION OF THE RCPSP : THE MULTI-SITE RCPSP

Abstract : This article proposes an extension of the Resource Constrained Project Scheduling Problem: the Multi-Site RCPSP with resource pooling between several sites. This extension considers new constraints for the RCPSP like transportation times and choice of the site where tasks are performed. A linear program of this problem is given. Four approximate methods are described: local search, simulated annealing and Iterated Local Searches with two different acceptance criteria: Simulated Annealing type acceptance criterion and Better Walk acceptance criterion. We compare the results obtained with each method. Simulated Annealing and Iterated Local Searches give good results.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02023753
Contributor : Nathalie Grangeon <>
Submitted on : Monday, March 11, 2019 - 5:12:38 PM
Last modification on : Monday, January 20, 2020 - 12:14:06 PM

File

arnaud_laurent_cie45.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02023753, version 1

Collections

Citation

Arnaud Laurent, Nathalie Grangeon, Laurent Deroussi, Sylvie Norre. MATHEMATICAL FORMULATION AND APPROXIMATE METHODS FOR AN EXTENSION OF THE RCPSP : THE MULTI-SITE RCPSP. CIE 45 45th International Conference on Computers & Industrial Engineering, 2015, Metz, France. ⟨hal-02023753⟩

Share

Metrics

Record views

22

Files downloads

56