TABU SEARCH FOR THE MULTI-MODE RESOURCE CONSTARINED PROJECT SCHEDULING PROBLEM WHITH RESOURCE FLEXIBILITY - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

TABU SEARCH FOR THE MULTI-MODE RESOURCE CONSTARINED PROJECT SCHEDULING PROBLEM WHITH RESOURCE FLEXIBILITY

Résumé

The scheduling problem under study may be viewed as an extension of the standard Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP) including Multi-Skilled Labor and will be called as MRCPSP-MS. This problem requires an integration of resource limitation, labor skills, and multiple possible execution modes for each task, and the objective is to minimize the overall project duration. This paper present a new tabu search (TS) algorithm using a powerful neighborhood function based on a flow graph representation in order to implement various search strategies. The search of the solution space is carried out via two types of moves. Furthermore, the TS algorithm is embedded in a decomposition based heuristic (DBH) which serve to reduce the solution space. The effectiveness of the new Tabu Search is demonstrated through extensive experimentation on different standard benchmark problem instances and proves that our results are competitive.
Fichier principal
Vignette du fichier
10.1.1.451.6582.pdf (176.77 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02354582 , version 1 (07-11-2019)

Identifiants

  • HAL Id : hal-02354582 , version 1

Citer

Y Kadrou, N M Najid. TABU SEARCH FOR THE MULTI-MODE RESOURCE CONSTARINED PROJECT SCHEDULING PROBLEM WHITH RESOURCE FLEXIBILITY. 19th International Conference on Production Research, Jul 2007, Valparaiso, Chile. ⟨hal-02354582⟩
25 Consultations
49 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More