Minimising Total Tardiness for Stochastic Resource and Machine Scheduling Problems

Abstract

We consider stochastic resource and machine scheduling problems and look at different representations for the problem accompanied with approaches to solve the problems. The approaches are based on local search. We look at the stochastic machine scheduling problem and at the stochastic resource constrained project scheduling problem. We compare different methods for approximating the expected total tardiness and compare these results for the different problems. We propose three evaluation methods. One based on percentiles, one based on simulation and one based on approximations with normal distributions.