2020/04/14 by Matthew Bold, Bold, Matthew, Marc Goerigk +1
Decision Sciences · Engineering · #FOS: Electrical engineering #FOS: Mathematics #Optimization and Control (math.OC) #Reliability and Maintenance Optimization #Resource-Constrained Project Scheduling #Scheduling and Optimization Algorithms #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2004.06547
openalex publication_date 2020/04/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper considers the resource-constrained project scheduling problem with\nuncertain activity durations. We assume that activity durations lie in a\nbudgeted uncertainty set, and follow a robust two-stage approach, where a\ndecision maker must resolve resource conflicts subject to the problem\nuncertainty, but can determine activity start times after the uncertain\nactivity durations become known. We introduce a new reformulation of the\nsecond-stage problem, which enables us to derive a compact robust counterpart\nto the full two-stage adjustable robust optimisation problem. Computational\nexperiments show that this compact robust counterpart can be solved using\nstandard optimisation software significantly faster than the current\nstate-of-the-art algorithm for solving this problem, reaching optimality for\nalmost 50% more instances on the same benchmark set.\n