Hybrid Genetic Algorithm for Minimizing the Range of Lateness and Make-span on Non-identical Parallel Machines

A hybrid genetic algorithm is presented for minimizing the range of lateness and make-span on parallel non-identical machines in this paper, and a dynamic fitness function is introduced too. The coding method of the hybrid genetic algorithm (HGA) is very simple because it utilized the property of effective optimal algorithm for solving the corresponding single machine problem. It made the implement of HGA be very easy. Numerical simulations illustrate that the HGA has the property of fast convergence, and can be used to solve larger size problems