# Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 1 of its 28 references that are in the map.
- First posted on arXiv 13 Sep 2024.

## Builds on (most cited first, 1 of 1)

- [Robust Local Search for Solving RCPSP/max with Durational Uncertainty](https://mlsanity.com/paper/1401.4595/) (2014)

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

- [Algorithms for dynamic scheduling in manufacturing, towards digital factories Improving Deadline Feasibility and Responsiveness via Temporal Networks](https://mlsanity.com/paper/2510.16047/) (2025)

## Abstract (arXiv)

This study investigates scheduling strategies for the stochastic resource-constrained project scheduling problem with maximal time lags (SRCPSP/max)). Recent advances in Constraint Programming (CP) and Temporal Networks have reinvoked interest in evaluating the advantages and drawbacks of various proactive and reactive scheduling methods. First, we present a new, CP-based fully proactive method. Second, we show how a reactive approach can be constructed using an online rescheduling procedure. A third contribution is based on partial order schedules and uses Simple Temporal Networks with Uncertainty (STNUs). Our statistical analysis shows that the STNU-based algorithm performs best in terms of solution quality, while also showing good relative offline and online computation time.