Multi-project scheduling problems with multi-skill resource constraints shared by several agents

EasyChair Preprint 2503

Abstract

This work presents a multi-agent problem in a project management context. In this context, several project managers, each managing one or more projects, are competing to obtain the human skills required to carry out their projects. Each agent wants to minimize a local objective function, which depends only on the scheduling of his/her set of activities. This function corresponds to minimize the weighted sum of the delay of its activities. Our aim is to find a good compromise solution. To calculate an optimal solution in the sense of Pareto, we use two approaches of resolution: linear combination of criteria and epsilon-constraint. For both approaches, we propose an Integer Linear Program (ILP) model and heuristics such as local descent and tabu search. We analyze the performances of the different resolution methods proposed through experiments performed on instances solved by ILP.

Keyphrases: Contraintes de personnel, Heuristiques., PLNE, gestion des compétences, heuristiques, ordonnancement de projets, recherche opérationnelle

@booklet{EasyChair:2503,
  author    = {Meya Haroune and Cheikh Dhib and Emmanuel Neron and Ameur Soukhal and Hafedh Mohamed Babou and Mohamedade Farouk Nanne},
  title     = {Multi-project scheduling problems with multi-skill resource constraints shared by several agents},
  howpublished = {EasyChair Preprint 2503},
  year      = {EasyChair, 2020}}