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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02264226
Contributor : Pierre Lopez <>
Submitted on : Tuesday, August 6, 2019 - 2:55:17 PM
Last modification on : Monday, August 19, 2019 - 11:49:29 AM

File

ICORES_2019_45_CR.pdf
Files produced by the author(s)

Identifiers

Citation

Oliver Polo-Mejía, 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⟩

Share

Metrics

Record views

47

Files downloads

16