Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines uri icon

Open Access

  • false

Peer Reviewed

  • true

Abstract

  • We consider scheduling heuristics for batching machines from semiconductor manufacturing. A batch is a collection of jobs that are processed at the same time on the same machine. The processing time of a batch is given by the identical processing time of the jobs within one incompatible family. We are interested in minimizing total weighted tardiness and makespan at the same time. In order to solve this problem, i.e. generate a Pareto-front, we suggest a multiobjective genetic algorithm. We present results from computational experiments on stochastically generated test instances that show the good solution quality of the suggested approach.

Veröffentlichungszeitpunkt

  • Januar 1, 2006