A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem

Abstract We study the robust resource-constrained project scheduling problem under budgeted uncertainty polytope. The problem can be seen as a very challenging variant of the resource-constrained project scheduling problem, where the objective function minimises the worst-case makespan, assuming that activity durations are subject to interval uncertainty. The model allows to control the level of robustness by means of a protection factor related to the risk aversion of the decision maker. The paper introduces two exact decomposition approaches to tackle the solution of this difficult problem. An extensive computational experimentation, on standard benchmark instances from the literature, is carried out to assess and compare the performance of the proposed methods, also with respect to the state-of-the-art exact solution approach.