A compact reformulation of the two-stage robust resource-constrained project scheduling problem

Bold, Matthew and Goerigk, Marc (2021) A compact reformulation of the two-stage robust resource-constrained project scheduling problem. Computers and Operations Research, 130: 105232. ISSN 0305-0548

Text (paper)
paper.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (601kB)

Abstract

This paper considers the resource-constrained project scheduling problem with uncertain activity durations. We assume that activity durations lie in a budgeted uncertainty set, and follow a robust two-stage approach, where a decision maker must resolve resource conflicts subject to the problem uncertainty, but can determine activity start times after the uncertain activity durations become known. We introduce a new reformulation of the second-stage problem, which enables us to derive a compact robust counterpart to the full two-stage adjustable robust optimisation problem. Computational experiments show that this compact robust counterpart can be solved using standard optimisation software significantly faster than the current state-of-the-art algorithm for solving this problem, reaching optimality for almost 50% more instances on the same benchmark set.