Mixed-integer and constraint programming formulations for a multi-skill project scheduling problem with partial preemption
Résumé
In this paper, we consider the weekly scheduling problem of activities within one of the research facilities of the French Alternative Energies and Atomic Energy Commission (CEA in short for French). To better represent this problem we propose a new variant of the multi-skill project scheduling problem (MSPSP) involving partial preemption. We describe the new MSPSP variant and we present two formulations for the problem: one using mixed-integer linear programming (MILP) and a second one using constraint programming (CP). Computational experiments on realistic data are carried out and discussed.
Domaines
Recherche opérationnelle [math.OC]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...