Hybrid differential evolution integrated with probability learning for green distributed reentrant job shop scheduling

被引:0
|
作者
Hu R. [1 ,3 ]
Wu X. [2 ,3 ]
Mao J.-L. [1 ]
Qian B. [1 ]
机构
[1] Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Yunnan, Kunming
[2] Yunnan Vocational College of Mechanical and Electrical Technology, Yunnan, Kunming
[3] Faculty of Mechanical and Electrical Engineering, Kunming University of Science and Technology, Yunnan, Kunming
基金
中国国家自然科学基金;
关键词
differential evolution; distributed scheduling; green scheduling; reentrant job shop scheduling problem;
D O I
10.7641/CTA.2023.20875
中图分类号
学科分类号
摘要
Aiming at the green distributed reentrant job shop scheduling problem (GDRJSSP), a hybrid differential evolution incorporated with probabilistic learning (HDE PL) is proposed to minimize the maximum completion time and the total energy consumption. According to the problem characteristics of the GDRJSSP, the rule of job allocation among factories and the encoding and decoding rules are designed, and the differential evolution algorithm is used to perform global search to find high-quality solution regions. In order to guide the global search direction more clearly, a multidimensional probability model based on Bayesian network structure is designed to reasonably learn and accumulate the pattern information of high-quality solutions (i.e., the better solutions in the current population). Combined with the structural characteristics of the problem solution, four neighborhoods based on the critical path are proposed to construct the local search, and an energy saving strategy based on the non-critical path is devised to enhance the ability of the algorithm to obtain low-power non-dominated solutions. Simulation experiments and algorithm comparisons verify that HDE PL can effectively solve the GDRJSSP. © 2024 South China University of Technology. All rights reserved.
引用
下载
收藏
页码:512 / 521
页数:9
相关论文
共 19 条
  • [1] ZHOU S C, JIN M Z, DU N., Energy-efficient scheduling of a single batch processing machine with dynamic job arrival times, Energy, 209, pp. 1-16, (2020)
  • [2] CHEN Tong, QIN Yuanhui, WAN Jianing, Et al., Re-entrant flexible scheduling: Models, algorithms and applications, Systems Engineering-Theory & Practice, 35, 5, pp. 1187-1201, (2015)
  • [3] SABERI-ALIABAD H, REISI-NAFCHI M, MOSLEHI G., Energy-efficient scheduling in anunrelated parallel machine environment under time-of-use electricity tariffs, Journal of Cleaner Production, 249, pp. 1-11, (2020)
  • [4] DING J Y, SONG S J, WU C., Carbon-efficient scheduling of flow shops by multi-objective optimization, European J of Operational Research, 248, 3, pp. 758-771, (2016)
  • [5] ZHANG B, PAN Q K, GAO L, Et al., A three-stage multi objective approach based on decomposition for an energy-efficient hybrid flow shop scheduling problem, IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50, 12, pp. 4984-4999, (2019)
  • [6] ABEDI M, CHIONG R, NOMAN N, Et al., A multi-population, multiobjective memetic algorithm for energy-efficient job-shop scheduling with deteriorating machines, Expert Systems with Applications, 157, pp. 1-17, (2020)
  • [7] LI Y B, HUANG W X, WU R, Et al., An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem, Applied Soft Computing, 95, pp. 1-14, (2020)
  • [8] WANG J J, WANG L., A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop, IEEE Transactions on Systems Man & Cybernetics Systems, 50, 5, pp. 1805-1819, (2018)
  • [9] ZHANG Ziqi, QIAN Bin, HU Rong, Et al., Multidimensional estimation of distribution algorithm for low carbon scheduling of distributed assembly permutation flow-shop, Control and Decision, 37, 5, pp. 1367-1377, (2022)
  • [10] JIANG E D, WANG L, PENG Z P., Solving energy-efficient distributed job shop scheduling via multi-objective evolutionary algorithm with decomposition, Swarm and Evolutionary Computation, 58, pp. 1-16, (2020)