MATHEMATICAL FORMULATION AND APPROXIMATE METHODS FOR AN EXTENSION OF THE RCPSP : THE MULTI-SITE RCPSP - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

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

Résumé

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.
Fichier principal
Vignette du fichier
arnaud_laurent_cie45.pdf (224.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02023753 , version 1 (11-03-2019)

Identifiants

  • HAL Id : hal-02023753 , version 1

Citer

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⟩
70 Consultations
257 Téléchargements

Partager

Gmail Facebook X LinkedIn More