Genetic Algorithms (GAs) have shown to fit the complex needs arisung from many tasks of academic optimization for almost 20 years.(...)

In dieser Arbeit wurde eine neue Form der Repräsentation von Maschinenbelegungsproblemen für Genetische Algorithmen vorgestellt. Sie behandelt die Maschinenbelegungsplanung in natürlicher Weise durch Reihenfolgenbildung von ausführenden Arbeitsgängen und umgeht dabei dennoch die...

Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem.(...)

TWe perform a novel analysis of the fitness landscape of thejob-shop scheduling problem (JSP). In contrast to other well-known combinatorial optimization problems, we show that the landscape of the JSP is non-regular, in that the connectivity of solutions is variable.

This article conducts a computational study for the Job Shop Scheduling Problem. The focus lies on the structure of the search space as it appears for local search.

A general model for job shop scheduling is described which applies to static, dynamic and non-deterministic production environments. Next, a Genetic Algorithm is presented which solves the job shop scheduling problem ...

A mixed-model assembly line requires the solution of a short-term sequencing prob-lem, which decides on the succession of different models launched down the line.A famous solution approach stemming from the Toyota Production System is theso-called Level Scheduling (LS), which aims to distribute...

A mixed-model assembly line requires the solution of a short-term sequencing prob-lem which decides on the succession of different models launched down the line. Afamous solution approach stemming from the Toyota Production System is the socalled Level Scheduling, which aims at distributing the...