Genetic Algorithm for single machine scheduling problem with setup times

摘要

This paper describes a genetic algorithm to solve the single machine scheduling problem with setup times, which uses the fixed two point crossover operator (F2PX) to produce new offspring chromosomes and uses the roulette wheel method in the selection of the chromosome population. In order to avoid the premature convergence we use a neighborhood based mutation operator to conduct disturbance in our genetic algorithm. Through the application of this genetic algorithm in practical scheduling problems, the effect of the genetic algorithm proposed in this paper is remarkable.