Linear programming based algorithms for preemptive and non-preemptive RCPSP

Jean Damay (1) , Alain A. Quilliot (1) , Eric Sanlaville (1, 2)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
2 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes

In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable is associated to a subset of independent activities (antichains). The properties of the model are first investigated. In particular, conditions are given that allow a solution of the linear program to be a feasible schedule. From these properties, an algorithm based on neighbourhood search is derived. One neighbour solution is obtained through one Simplex pivoting, if this pivoting preserves feasibility. Methods to get out of local minima are provided. The solving methods are tested on the PSPLIB instances in a preemptive setting and prove efficient. They are used when preemption is forbidden with less success, and this difference is discussed.

Domaines: Recherche opérationnelle [math.OC]

Jean Damay, Alain A. Quilliot, Eric Sanlaville. Linear programming based algorithms for preemptive and non-preemptive RCPSP. Eur. Journal of Oper. Res., 2007, 182, pp.1012-1022. ⟨hal-00445417⟩