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.
-
表 1 加工能耗
kJ/min 能耗 M1 M2 M3 M4 M5 M6 M7 M8 T1 2 5 1 2 4 4 1 6 T2 3 2 1 3 5 3 2 2 T3 2 3 2 2 1 1 1 4 T4 2 1 3 5 3 1 6 3 T5 4 2 2 1 2 6 2 1 T6 5 3 4 4 2 2 4 1 T7 1 6 2 1 3 2 3 2 T8 2 3 5 2 2 1 1 1 表 2 3种算法的目标函数极值
算法 非支配解数量 ${f_1}$/min ${f_2}$/kJ 标准NSGA-II算法 14 23 241 文献[17]混合NSGA-II算法 19 20 230 邻域拥挤淘汰NSGA-II算法 22 18 221 表 3 重调度方案任务完成时间
min 时间 静态调度方案 重调度方案 加急订单完工时间 整体完工时间 加急订单完工时间 整体完工时间 优先加工通道 18 18 14 18 滚动遗传算法 18 18 14 20 -
[1] Borreguero-Sanchidrian T, Pulido R, Garcia-Sanchez A, et al. Flexible job shop scheduling with operators in aeronautical manufacturing: a case study[J]. IEEE Access, 2018, 6: 224-233. doi: 10.1109/ACCESS.2017.2761994 [2] 李稚, 周双牛. 基于GABSO算法的动态柔性作业车间调度问题[J]. 系统工程, 2022, 40(1): 143-151. [3] Ahmadi E, Zandieh M, Farrokh M, et al. A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms[J]. Computers & Operations Research, 2016, 73: 56-66. [4] 程胜明, 王雅君, 张昕晨, 等. 基于智能制造的混合流水车间插单动态调度[J]. 大连工业大学学报, 2022, 41(5): 386-390. doi: 10.19670/j.cnki.dlgydxxb.2022.0513 [5] 斯兴瑶, 廖映华, 任少波, 等. 基于滚动窗口技术和遗传算法的柔性作业车间动态调度研究[J]. 机电工程, 2022, 39(1): 87-93. doi: 10.3969/j.issn.1001-4551.2022.01.013 [6] 王艺霖. 混合蝙蝠算法及其在调度管理中的应用研究[D]. 上海: 东华大学, 2022. [7] Ortiz Barrios M, Neira-Rodado D, Jimenez G, et al. Integration of dispatching algorithm and AHP-TOPSIS method for flexible job-shop scheduling problem: a case study from the apparel industry[J]. International Journal of Manufacturing Science and Technology, 2021(1): 15. [8] Rakovitis N, Li D, Zhang N, et al. Novel approach to energy-efficient flexible job-shop scheduling problems[J]. Energy, 2021(5): 121773. [9] 杜晓亮, 张楠, 孟凡云, 等. 改进NSGA2算法求解柔性作业车间调度问题[J]. 组合机床与自动化加工技术, 2022(5): 182-186. doi: 10.13462/j.cnki.mmtamt.2022.05.044 [10] Nouiri M, Bekrar A, Jemai A, et al. Two stage particle swarm optimization to solve the flexible job shop predictive scheduling problem considering possible machine breakdowns[J]. Computers & Industrial Engineering, 2017, 112: 595-606. [11] 任玺悦, 王修贤, 耿娜, 等. 考虑多急件到达的作业车间重调度研究[J]. 工业工程与管理, 2022, 27(3): 74-83. doi: 10.19495/j.cnki.1007-5429.2022.03.009 [12] 尤一琛, 王艳, 纪志成. 基于博弈论的柔性作业车间动态调度研究[J]. 系统仿真学报, 2021, 33(11): 2579-2588. doi: 10.16182/j.issn1004731x.joss.21-FZ0704 [13] 张守京, 王彦亭, 罗志轩. 免疫度下的柔性车间动态重调度研究[J]. 机械科学与技术, 2021, 40(1): 109-115. doi: 10.13433/j.cnki.1003-8728.20200029 [14] Rashid M A, Khatib F, Hoque M T, et al. An enhanced genetic algorithm for ab initio protein structure prediction[J]. IEEE Transactions on Evolutionary Computation, 2016, 20(4): 627-644. doi: 10.1109/TEVC.2015.2505317 [15] 徐金辉, 涂海宁, 陆远. 智能制造单元生产调度算法研究[J]. 制造技术与机床, 2020(3): 134-138. doi: 10.19287/j.cnki.1005-2402.2020.03.028 [16] Adamou Mitiche A, Mitiche L. Multivariable systems model reduction based on the dominant modes and genetic algorithm[J]. IEEE Transactions on Industrial Electronics, 2017,64(2): 1617-1619. [17] 宋昌兴, 阮景奎, 王宸. 基于混合多目标遗传算法的柔性作业车间调度问题研究[J]. 机电工程, 2021, 38(2): 169-176. doi: 10.3969/j.issn.1001-4551.2021.02.005