Robust optimization approach for the resource-constrained project scheduling problem with uncertain activity release times

Abstract

This paper studies the resource-constrained project scheduling problem (RCPSP) with uncertain activity release times, a practical problem rarely addressed in the literature. A robust optimization formulation of the problem is proposed, where the activity release times are defined in a polyhedral uncertainty set. A decomposition algorithm from the literature for the RCPSP with uncertain activity processing times is adapted to solve the problem. Alternatively, a new algorithm is proposed was developed based on the mathematical properties of the optimal solution. Extensive computational experiments on instances from the PSPLIB and on an industrial instance generated from aircraft manufacturing, are carried out to assess the performance of the proposed algorithms. The numerical results show that the dedicated algorithm is significantly faster than the adapted algorithm. Sensitivity analyses also provide valuable managerial insights.