Lars Mönch

TL;DR: Typical scheduling problems found in semiconductor manufacturing systems are identified and important solution techniques used to solve these scheduling problems are presented by means of specific examples, and known implementations are reported.

TL;DR: This research attempts to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs by developing variations of a time window heuristic based on a decision theory approach for forming and sequencing the batches on a single machine.

TL;DR: This research attempts to minimize total weighted tardiness on parallel batch machines with incompatible job families by proposing two different versions of a genetic algorithm (GA), each consisting of three different phases, and shows that algorithms of the first version of the GA outperform traditional dispatching rules with respect to solution quality and computation time.

TL;DR: It turns out that using near to optimal sub problem solution procedures leads in many situations to improved results compared to dispatching-based subproblem solution procedures.