A robust optimization approach for the multi-mode resource-constrained project scheduling problem

This paper suggests a robust optimization approach for the multi-mode resource-constrained project scheduling problem with uncertain activity durations. The objective is to minimize the worst-case project duration by deciding on activity modes, resource allocations and a schedule baseline. The problem is solved by a Benders decomposition approach with specialized cuts. We consider polyhedral uncertainty sets in which the level of conservatism can be adjusted. Using a computational study in which various problem instances are explored under varying levels of uncertainty, conservatism and several types of duration distributions, we provide insights about the price of robustness and the performance of the approach. The hope is that these insights can guide future multi-mode project scheduling implementations when there is partial information about the distribution of activity durations. (c) 2019 Elsevier B.V. All rights reserved.