# A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem

arXiv: https://arxiv.org/abs/2203.06983 · HTML: https://mlsanity.com/paper/2203.06983/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Mar 2022.

## Built on by (most cited first, 1 of 1)

- [Accelerated Genetic Programming Hyper-Heuristics for Simulation-Based Scheduling via Agentic AI](https://mlsanity.com/paper/2608.19487/) (2026)

## Abstract (arXiv)

This paper presents a mixed-integer linear programming formulation for the multi-mode resource-constrained project scheduling problem with uncertain activity durations. We consider a two-stage robust optimisation approach and find solutions that minimise the worst-case project makespan, whilst assuming that activity durations lie in a budgeted uncertainty set. Computational experiments show that this easy-to-implement formulation is many times faster than the current state-of-the-art solution approach for this problem, whilst solving over 40% more instances to optimality over the same benchmarking set.