工序顺序柔性的作业车间调度问题的改进遗传算法求解

摘要

For the job shop scheduling problem with process sequence flexibility in process design,types and characteristic of flexible process sequence are analyzed,and an improved genetic algorithm(IGA)is proposed to solve this problem.With a view to shortening the span of manufacture,an improved chromosome encoding schema is proposed in consideration of the characteristic of the problem.In the schema,coding method based on sequence flexibility is added to the general coding method based on procedure order.The corresponding crossover and mutation operators are designed to prevent the generation of non-feasible solutions to avoid chromosome repair in the computing process and enhance the efficiency of the algorithm.This algorithm is tested by simulation experiments on MATLAB using the practical production data of a bearing corporation.Compared with the results of solving the problem without consideration of the process sequence flexibility characteristic using genetic algorithm,the feasibility and efficiency of the algorithm proposed in the paper can be verified.%针对在工艺设计中提供工序顺序柔性的作业车间调度问题,总结了该问题中柔性工序顺序的类型和特点,并提出了一种求解该问题的改进遗传算法.以尽可能缩短制造周期为目标,结合问题特点,改进了染色体的编码方式,在常用的基于工序顺序的编码方法上融入了基于柔性工序顺序的编码方法,并据此设计了相应的交叉、变异等操作,防止遗传过程中不可行解的产生,避免染色体修复,提高求解效率.最后以MATLAB为工具用某轴承公司的实际生产数据对该算法进行了仿真.通过与不考虑工序顺序柔性的作业车间调度问题遗传算法求解结果进行对比,证明了该算法可行性和有效性.