Memory and feasibility indicators in GRASP for Multi-Skill Project Scheduling with Partial Preemption

Abstract : This paper describes a GRASP algorithm aiming to solve a new scheduling problem known as the Multi-Skill Project Scheduling Problem with Partial Preemption, in which not all resources are released during preemption periods. We use a self-adaptive strategy for fixing the cardinality of the restricted candidate list in the greedy phase of the GRASP. We also propose an adaptive evaluation function that includes memory-based intensification, exploiting the characteristics of the best solutions, and a feasibility element for increasing the number of feasible solutions visited. Numerical experiments show the interest of the proposed approach.
Document type :
Conference papers
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02264213
Contributor : Pierre Lopez <>
Submitted on : Tuesday, August 6, 2019 - 2:50:15 PM
Last modification on : Monday, August 19, 2019 - 11:52:15 AM

File

MIC2019.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02264213, version 1

Citation

Oliver Polo-Mejía, Christian Artigues, Pierre Lopez, Lars Mönch. Memory and feasibility indicators in GRASP for Multi-Skill Project Scheduling with Partial Preemption. XIII Metaheuristics International Conference (MIC 2019), Jul 2019, Carthagène des Indes, Colombia. pp.153-156. ⟨hal-02264213⟩

Share

Metrics

Record views

30

Files downloads

7