Mixed-integer and constraint programming formulations for a multi-skill project scheduling problem with partial preemption

Oliver Polo Mejia (1, 2, 3) , Marie-Christine Anselmet (1, 2) , Christian Artigues (3) , Pierre Lopez (3)

1 CEA - Commissariat à l'énergie atomique et aux énergies alternatives
2 DEC - Département d'Etudes des Combustibles
3 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes

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.

Mots clés: MSPSP; RCPSP; Partial preemption; Nuclear laboratory; Scheduling

Domaines: Recherche opérationnelle [math.OC]

Oliver Polo Mejia, Marie-Christine Anselmet, Christian Artigues, Pierre Lopez. Mixed-integer and constraint programming formulations for a multi-skill project scheduling problem with partial preemption. 12th International Conference on Modelling, Optimization and Simulation (MOSIM 2018), Jun 2018, Toulouse, France. pp.367-374. ⟨hal-01830739⟩