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.