Genetic Algorithm Method Based on Combinatorial Rules in Identaical Parallel Machine Scheduling Problem

A kind of genetic algorithm based on combinatorial rules is presented for solving the identical machine scheduling problem of minimizing the makespan,that is,scheduling policy is optimized by genetic algorithm,and it allows that different scheduling rule to be adopted at different scheduling stage to improve the performance of the algorithm.Computational results show that the genetic algorithm has advantage over simulated annealing and genetic algorithms based on machine code and is fit for large scale identical parallel machine scheduling problem,and that the algorithm has small quantity of calculation and strong robustness.