Evaluating Proactive, Reactive, and Hybrid Strategies for the Stochastic Multi-Mode RCPSP with Hard Deadlines
A. Shiamishis (TU Delft - Electrical Engineering, Mathematics and Computer Science)
K.C. van den Houten – Mentor (TU Delft - Algorithmics)
J.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
Stochastic scheduling is a crucial and rapidly growing field that attracts significant interest across numerous domains, particularly in the development of digital factories. We evaluate and compare three algorithms for the stochastic Multi-Mode Resource Constrained Project Scheduling Problem with Hard Deadlines. We outline the proactive, reactive and hybrid approaches and compare their performance in terms of feasibility, execution time and makespan. We also experiment with higher variance, different instance sizes and duration distributions to understand the factors that affect performance. Our results highlight the potential of the hybrid approach and demonstrate the fundamental trade-off between robustness and schedule quality.