CP for Scheduling under Uncertainty
A Comparative Study of STNUs against Proactive and Reactive Approaches
M.C. Steeghs (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Mathijs M. de Weerdt – Mentor (TU Delft - Algorithmics)
Kim van den Houten – Mentor (TU Delft - Algorithmics)
Léon Planken – Mentor (TU Delft - Research Engineering & Infrastructure Team)
Jasmijn A. Baaijens – Graduation committee member (TU Delft - Pattern Recognition and Bioinformatics)
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 report investigates the effectiveness of Simple Temporal Networks with Uncer- tainty (STNUs) for solving the Stochastic Flexible Job-Shop Scheduling Problem with Sequence-Dependent Setup Times (SFJSP-SDST), comparing it against proactive and reactive Constraint Programming (CP) approaches. Using a benchmark dataset with varying noise levels, the study evaluates solution quality, feasibility, and computational cost. Results show that the reactive method achieves the lowest makespan due to its dy- namic rescheduling capability but incurs high online computation time. The proactive method offers fast execution, while the STNU-based approach provides a dynamically controllable schedule, albeit with conservative makespans.