Event-based MILP models for resource-constrained project scheduling problems

Oumar Koné (1) , Christian Artigues (1) , Pierre Lopez (1) , Marcel Mongeau (2)

1 LAAS-MOGISA
2 MAIA-OPTIM - ENAC Equipe MAIAA-OPTIM

In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we present three discrete and continuous time MILP formulations issued from the literature. Second, instead of relying on the traditional discretization of the time horizon, we propose two original MILP formulations for the RCPSP based on the concept of event : the Start/End formulation and the On/Off formulation. These formulations present the advantage of involving fewer variables than the formulations indexed by time. Because the variables of this type of formulations are not function of the time horizon, we have a better capacity to deal with instances of very large scheduling horizon. We also illustrate our contribution with a series of tests on various types of instances with the three MILP formulations issued from the literature together with our two new formulations, and we draw some conclusions on their use.

Mots clés: Resource-constrained project scheduling; mixed integer linear programming; project management

Domaines: Recherche opérationnelle [math.OC]

Oumar Koné, Christian Artigues, Pierre Lopez, Marcel Mongeau. Event-based MILP models for resource-constrained project scheduling problems. Computers and Operations Research, 2011, 38 (1), pp.3-13. ⟨10.1016/j.cor.2009.12.011⟩. ⟨hal-00361395⟩