A Genetic Algorithm for Minimizing Completion Time with Non-identical Parallel Machines

Abstract

This paper considers a parallel-machine scheduling problem with dedicated and common processing machines.Non-identical setup and processing times are assumed for each machine. A genetic algorithm is proposed to minimize the makespan objective measure. In this paper, a lowerbound and some heuristic algorithms are derived and tested through computational experiments.