A heuristic method for the Multi-Skill Project Scheduling Problem with Partial Preemption - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

A heuristic method for the Multi-Skill Project Scheduling Problem with Partial Preemption

Résumé

In this article we consider a new scheduling problem known as the Multi-Skill Project Scheduling Problem with Partial Preemption. The main characteristic of this problem is the way we handle the resources release during the preemption periods: only a subset of resources are released. Since this problem is NP-hard, we propose a greedy algorithm based on priority rules, modeling the subproblem of technicians allocation as a Minimum-Cost Maximum-Flow problem. In order to improve the performance of the greedy algorithm, we propose a randomized tree-based local search algorithm. Computational tests are carried out and analyzed.
Fichier principal
Vignette du fichier
ICORES_2019_45_CR.pdf (550.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02264226 , version 1 (06-08-2019)

Identifiants

Citer

Oliver Polo Mejia, Christian Artigues, Pierre Lopez. A heuristic method for the Multi-Skill Project Scheduling Problem with Partial Preemption. 8th International Conference on Operations Research and Enterprise Systems (ICORES 2019), Feb 2019, Prague, Czech Republic. pp.111-120, ⟨10.5220/0007390001110120⟩. ⟨hal-02264226⟩
193 Consultations
257 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More