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

Abstract

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 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. Finally, we illustrate our contribution with a series of tests on various types of instance with the MILP formulations issued from the literature, together with our new formulations. We also compare our results with a recent RCPSP-specific exact method. We show that, in terms of exact solving, no MILP formulation class dominates the other ones and that a state-of-the art specialized (non-MILP) method for the RCPSP is even outperformed by MILP on a set of hard instances. Furthermore, on another set of hard “highly cumulative” RCPSP instances with a high processing time range, our On/Off formulation outperforms all the others MILP formulations and obtains results close to the ones of the specialized method.