考虑订单加急生产的柔性车间作业动态调度

Dynamic scheduling of flexible job shop considering order expedited production

为了解决订单加急生产扰动下的柔性车间动态重调度问题,以缩短整体加工时间为目标,提出了一种基于强制进化遗传算法和记忆优先加工通道的动态重调度方法。首先,对车间动态重调度问题进行了描述和建模;然后,针对柔性车间静态调度问题,设计了遗传概率和操作范围随个体自适应变化的方法,提出了强制进化遗传算法的静态调度算法;针对订单加急扰动下的动态重调度问题,设置了具有记忆能力的优先加工通道;最后,以6工件生产车间为实验背景,对柔性车间动态重调度方法进行了实验验证,即对基于强制进化遗传算法的静态调度性能以及基于记忆优先通道的动态重调度性能,分别进行了验证。实验结果表明:基于强制进化遗传算法的静态调度方案的平均加工时间为39.4 min,比改进遗传算法减少了4.57%,比标准遗传算法减少了6.85%;在不同加急时刻、不同工件加急的工况下,记忆优先加工通道的加急订单生产时间、整体加工时间均小于贪婪自适应方法。研究结果表明,基于记忆优先加工通道的重调度方案兼顾了紧急订单的加工时间和整体订单的加工时间。

In order to solve the dynamic rescheduling problem of flexible workshop under the disturbance of urgent order production,a dynamic rescheduling method based on forced evolutionary genetic algorithm and memory priority processing channel was proposed to shorten the overall processing time.Firstly,the dynamic rescheduling problem was described and modeled.Then,aiming at the static scheduling problem of flexible workshop,a method of genetic probability and operation range changing adaptively with individuals was designed,and a static scheduling algorithm of forced evolutionary genetic algorithm was proposed.For the dynamic rescheduling problem under the disturbance of urgent orders,a priority processing channel with memory ability was set up.Finally,taking the 6-Piece workshop as the experimental background,the dynamic rescheduling method of flexible workshop was experimentally verified,namely,the static scheduling performance based on forced evolutionary genetic algorithm and the dynamic rescheduling performance based on memory priority channel were verified respectively.The experiment results show that the average processing time of the static scheduling scheme of the forced evolutionary genetic algorithm is 39.4 min,which is 4.57%less than that of the improved genetic algorithm and 6.85%less than that of the standard genetic algorithm.Under the working conditions of different expediting times and different workpiece expediting,the expedited order production time and overall processing time of memory priority processing channel are less than those of the greedy adaptive method.The results show that the rescheduling scheme based on memory priority processing channel takes into account the processing time of emergency orders and the processing time of overall orders.