订单加急扰动下柔性生产车间动态完全重调度

Dynamic complete rescheduling of flexible production shop under order expediting disturbance

  • 摘要: 为了提高订单加急扰动时柔性生产车间重调度的效率,提出了基于邻域拥挤度淘汰NSGA-II算法和优先加工通道的重调度方案。针对订单加急扰动下重调度问题,建立了减少车间能耗和完工时间的双重优化模型。构造了多目标优化问题的邻域,提出了基于邻域拥挤度淘汰NSGA-II算法的柔性车间静态调度方法。当订单加急扰动发生时,设计了基于优先加工通道的完全重调度方案。使用Kacem02标准算例对静态调度性能测试,文章算法的优化目标极值小于标准NSGA-II算法和混合NSGA-II算法,说明该算法的优化能力更强。订单加急扰动后,优先加工通道和滚动遗传算法均将加急订单完成时间由18 min提前到14 min,但是前者保持了整体完工时间不变,而后者整体加工时间由18 min增加到20 min,结果表明优先加工通道在柔性车间重调度中具有更好性能。

     

    Abstract: In order to improve the rescheduling efficiency of flexible production shop when the order urgency disturbance exists, a rescheduling scheme based on neighborhood crowding degree NSGA-II algorithm and priority processing channel is proposed. Aiming at rescheduling problem under order urgency disturbance, a dual optimization model was established to reduce workshop energy consumption and completion time. The neighborhood of multi-objective optimization problem is constructed, and a flexible static job shop scheduling method based on neighborhood crowding degree NSGA-II algorithm is proposed. When the order urgent disturbance occurs, a complete rescheduling scheme based on the priority processing channel is designed. The Kacem02 standard example is used to test the static scheduling performance. The optimization objective extreme value of the algorithm in this paper is smaller than the standard NSGA-II algorithm and the hybrid NSGA-II algorithm, which shows that the optimization ability of the algorithm in this paper is stronger. After the order urgent disturbance, both the priority processing channel and the rolling genetic algorithm advance the completion time of the urgent order from 18 min to 14 min, but the former keeps the overall completion time unchanged, while the latter increases the overall processing time from 18 min to 20 min. The results show that the priority processing channel has better performance in flexible shop rescheduling.

     

/

返回文章
返回