计算机工程与应用2016，Vol.52Issue(12)：227-230,4.DOI:10.3778/j.issn.1002-8331.1407-0568
确定型流水车间调度的遗传算法研究
Research on Genetic Algorithm for surely flow-shop scheduling problem
刘兰兰 1张曦煌 1陈志国1
作者信息
- 1. 江南大学 物联网学院，江苏 无锡 214122
- 折叠
摘要
Abstract
In order to verify the genetic algorithm is better than heuristic rules in solving the surely flow shop scheduling problem, this paper analyzes the characteristics of the surely flow shop scheduling problem, and applies the new algorithm to solve the problem. In order to improve the search efficiency and avoid falling into local optimal solution, this paper pro-poses a new method of the initial population and successfully applies the method to solve the surely flow shop scheduling problem. The simulation experiment result proves the practicality, reliability, and super application value of the improved genetic algorithm.关键词
车间调度/遗传算法/确定型流水车间调度Key words
workshop scheduling/genetic algorithm/surely flow-shop scheduling分类
信息技术与安全科学引用本文复制引用
刘兰兰,张曦煌,陈志国..确定型流水车间调度的遗传算法研究[J].计算机工程与应用,2016,52(12):227-230,4.
