基于改进遗传算法的不确定加工时间Flow-Shop鲁棒调度  

Research on Flow-shop Scheduling with Uncertain Processing Times Based on Improved Genetic Algorithm

作　　者：杜先军 

机构地区：[1]合肥工业大学机械与汽车工程学院,合肥230009

出　　处：《机械工程师》2016年第9期65-67,共3页Mechanical Engineer

摘　　要：对不确定加工时间环境下的Flow-shop调度问题进行了研究,利用六点模糊数对不确定加工时间进行描述,以最大完工时间和最大完工时间跨度的权重和为鲁棒性测度构建模糊加工时间Flow-shop调度模型。提出了模型求解的改进遗传算法,算法采用单染色体遍历操作代替染色体交叉操作,用以增强种子代繁衍的确定性,最后仿真分析验证了算法的有效性。Flow-shop scheduling with uncertain processing times is researched in this paper. Six-fuzzy-number is used todescribe uncertain processing times. The fuzzy processing times Flow-shop scheduling model is constructed and i t treat the weight of the maximum completion time and its time span as the robustness measure. The improved genetic algorithm （ IGA） which uses single chromosome traversal to replace chromosomal chiasma is developed to solve this model; and simulation experiment data shows the superiority of IGA in this area.

关 键 词：Flow-shop调度 六点模糊数 改进遗传算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]