Many recent algorithmic approaches suffer from their limited applicability to dynamic scheduling scenarios. Genetic Algorithms have been shown to overcome this problem at the expense of searching less efficient. We propose a flexible dispatching procedure which is controlled by a Genetic...

This paper adresses job tardiness for non deterministic job shop scheduling. A comparative study shows that a GA consistently outperforms different priority rules regardless of the workload and the objective pursued.

We investigate a combined routing and scheduling problem for the maintenance of electricity networks. In electricity networks power lines must be regularly maintained to ensure a high quality of service. For safety reasons a power line must be physically disconnected from the network before...