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.

Auftragseinplanung zur Produktion in der Automobilindustrie -- Genetische Algorithmen als Suchverfahren -- Die Auftragseinplanung im vernetzten Planungsprozess -- Nutzung Genetischer Algorithmen im globalen Planungskontext.