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 consider job shop scheduling problems with release and due-dates, as well as various tardiness objectives. To date, no efficient general-purpose heuristics have been developed for these problems. genetic algorithms can be applied almost directly, but come along with apparent weaknesses.

Abstract. In order to sequence the tasks of a job shopproblem (JSP) on a number of machines related to thetechnological machine order of jobs, a new representationtechnique - mathematically known as "permutationwith repetition" is presented. The main advantage of thissingle chromosome...