Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags
Kim van den Houten (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Léon Planken (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Esteban Freydell (DSM)
David M.J. Tax (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Mathijs de Weerdt (TU Delft - Electrical Engineering, Mathematics and Computer Science)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
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 re-invoked 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.