计算机与数字工程2019，Vol.47Issue(2)：285-288,4.DOI:10.3969/j.issn.1672-9722.2019.02.006
基于改进遗传算法的柔性车间调度问题的研究
Research on Flexible Job Shop Scheduling Problem Based on Improved Genetic Algorithm
曹睿 1侯向盼 2金巳婷3
作者信息
- 1. 大连交通大学 大连 116028
- 2. 中车青岛四方机车车辆股份有限公司 青岛 266031
- 3. 沈阳铁路局通信段 沈阳 110001
- 折叠
摘要
Abstract
This paper analyzes the characteristics of flexible job shop scheduling problem,and proposes an improved genetic algorithm to solve the problem. In the case of the maximum completion time as the performance index,a flexible shop scheduling method based on the improved algorithm is designed to change the population initialization method to improve the search efficiency, and combine the problem characteristics to design a reasonable chromosome coding method,crossover operator and mutation opera?tor to improve Solving efficiency. The feasibility and validity of the proposed initialization method are verified by experimental simu?lation.关键词
遗传算法/柔性车间调度Key words
genetic algorithm/flexible shop scheduling分类
信息技术与安全科学引用本文复制引用
曹睿,侯向盼,金巳婷..基于改进遗传算法的柔性车间调度问题的研究[J].计算机与数字工程,2019,47(2):285-288,4.
