A Heuristic Method for the Multi-skill Project Scheduling Problem with Partial Preemption

Oliver Polo-Mejía, Christian Artigues, Pierre Lopez

2019

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.

Paper Citation

in Harvard Style

Polo-Mejía O., Artigues C. and Lopez P. (2019). A Heuristic Method for the Multi-skill Project Scheduling Problem with Partial Preemption.In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-352-0, pages 111-120. DOI: 10.5220/0007390001110120

in Bibtex Style

@conference{icores19,
author={Oliver Polo-Mejía and Christian Artigues and Pierre Lopez},
title={A Heuristic Method for the Multi-skill Project Scheduling Problem with Partial Preemption},
booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2019},
pages={111-120},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007390001110120},
isbn={978-989-758-352-0},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Heuristic Method for the Multi-skill Project Scheduling Problem with Partial Preemption
SN - 978-989-758-352-0
AU - Polo-Mejía O.
AU - Artigues C.
AU - Lopez P.
PY - 2019
SP - 111
EP - 120
DO - 10.5220/0007390001110120