摘要
针对柔性作业车间调度问题的特点,以最大完工时间作为性能指标,提出一种基于改进遗传算法的柔性作业车间调度方法。采用一种新的初始化方法来提高种群初始解的质量,加快遗传算法的收敛速度,并通过实例测试验证了该算法的可行性。
Based on the analysis of the traits of flexible job-shop scheduling problem, proposes an improved genetic algorithm to minimize the makespan. Adopts a new initialization method to improve the quality of the initial population and accelerate the speed of the algorithm/s convergence. Consides the characteristic of the problem, reasonable chromosome encoding, gives crossover and mutation operator, and proves the effectiveness of the improved algorithm is by testing.
出处
《现代计算机》
2014年第4期29-33,44,共6页
Modern Computer
关键词
遗传算法
柔性作业车间调度
初始化种群
Genetic Algorithm
Flexible Job-Shop Scheduling
Initialization Population
