混合遗传算法求解车间作业调度问题

On Job-Shop Scheduling by Hybrid Genetic Algorithm

分析了生产调度问题,提出一种更为有效的动态混合遗传算法,成功地解决了复杂的FT10×10问题.研究过程中引入自适应遗传算法思想,结合一种能够很好解决调度问题的编码规则和适应度值函数,对该算法进行了详细分析.为防止在遗传操作过程中非法染色体导致程序运行失败,给出了非法染色体合法化的规则.仿真结果表明,该算法和编码规则非常适合调度问题,且所提出的动态混合算法优于其它算法.

The quick reengineering of enterprise needs the shortest manufacturing time.Jobshop scheduling is the abstraction of production scheduling.In recent years,scheduling algorithms based on local searching technology are paid more attention to by many researchers,such as the simulated annealing,Tabu,and genetic algorithm(GA).In this paper,a production scheduling problem is discussed and an effective dynamic hybrid genetic algorithm is proposed to solve the complex FT10×10 problem successfully.In the research,adaptive genetic algorithm(AGA)is introduced and a new encade rules and a fitness function are used .The new algorithm is analyzed in detail and the rules of correct the bad chromosome is given in order to avoid the fail operation of the program resulted from the bad chromosome.The simulating results show that the new algorithms and rules are suitable for the production scheduling and the dynamic hybrid genetic algorithm is more effective than others.