Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags
<|reference_start|>Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags: 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.<|reference_end|>
@article{houten2024proactive,
    title={Proactive and Reactive Constraint Programming for Stochastic Project
  Scheduling with Maximal Time-Lags},
    author={Kim van den Houten, L'eon Planken, Esteban Freydell, David M.J. Tax,
  Mathijs de Weerdt},
    journal={arXiv preprint arXiv:2409.09107},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.09107},
    primaryClass={cs.AI}
}