Adaptive Population NSGA-III with Dual Control Strategy for Flexible Job Shop Scheduling Problem with the Consideration of Energy Consumption and Weight

被引:15
|
作者
Wu, Mingliang [1 ,2 ]
Yang, Dongsheng [1 ,2 ]
Zhou, Bowen [1 ,2 ]
Yang, Zhile [3 ]
Liu, Tianyi [1 ,2 ]
Li, Ligang [4 ]
Wang, Zhongfeng [4 ]
Hu, Kunyuan [4 ]
机构
[1] Northeastern Univ, Intelligent Elect Sci & Technol Res Inst, Shenyang 110819, Peoples R China
[2] Northeastern Univ, Key Lab Integrated Energy Optimizat & Secure Oper, Shenyang 110819, Peoples R China
[3] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China
[4] Chinese Acad Sci, Shenyang Inst Automat, Shenyang 110169, Peoples R China
基金
美国国家科学基金会; 国家重点研发计划;
关键词
flexible job shop scheduling problem; energy consumption; makespan; NSGA-III; dual control strategy; GENETIC ALGORITHM; MULTIOBJECTIVE OPTIMIZATION;
D O I
10.3390/machines9120344
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The flexible job shop scheduling problem has always been the focus of research in the manufacturing field. However, most of the previous studies focused more on efficiency and ignored energy consumption. Energy, especially non-renewable energy, is an essential factor affecting the sustainable development of a country. To this end, this paper designs a flexible job shop scheduling problem model with energy consideration more in line with the production field. Except for the processing stage, the energy consumption of the transport, set up, unload, and idle stage are also included in our model. The weight property of jobs is also considered in our model. The heavier the job, the more energy it consumes during the transport, set up, and unload stage. Meanwhile, this paper invents an adaptive population non-dominated sorting genetic algorithm III (APNSGA-III) that combines the dual control strategy with the non-dominated sorting genetic algorithm III (NSGA-III) to solve our flexible job shop scheduling problem model. Four flexible job shop scheduling problem instances are formulated to examine the performance of our algorithm. The results achieved by the APNSGA-III method are compared with five classic multi-objective optimization algorithms. The results show that our proposed algorithm is efficient and powerful when dealing with the multi-objective flexible job shop scheduling problem model that includes energy consumption.
引用
收藏
页数:24
相关论文
共 50 条
  • [1] NSGA-III for solving dynamic flexible job shop scheduling problem considering deterioration effect
    Wu, Xiuli
    Li, Jing
    Shen, Xianli
    Zhao, Ning
    [J]. IET COLLABORATIVE INTELLIGENT MANUFACTURING, 2020, 2 (01) : 22 - 33
  • [2] A survival duration-guided NSGA-III for sustainable flexible job shop scheduling problem considering dual resources
    Li Hongyu
    Wu Xiuli
    [J]. IET COLLABORATIVE INTELLIGENT MANUFACTURING, 2021, 3 (02) : 119 - 130
  • [3] A Tailored NSGA-III for Multi-objective Flexible Job Shop Scheduling
    Wang, Yali
    van Stein, Bas
    Back, Thomas
    Emmerich, Michael
    [J]. 2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 2746 - 2753
  • [4] Research on Many-Objective Flexible Job Shop Intelligent Scheduling Problem Based on Improved NSGA-III
    Sang, Yanwei
    Tan, Jianping
    Liu, Wen
    [J]. IEEE ACCESS, 2020, 8 : 157676 - 157690
  • [5] Modified Multi-Crossover Operator NSGA-III for Solving Low Carbon Flexible Job Shop Scheduling Problem
    Sun, Xingping
    Wang, Ye
    Kang, Hongwei
    Shen, Yong
    Chen, Qingyi
    Wang, Da
    [J]. PROCESSES, 2021, 9 (01) : 1 - 21
  • [6] A Two-Stage Individual Feedback NSGA-III for Dynamic Many-Objective Flexible Job Shop Scheduling Problem
    Feng, Yi
    Lin, Yating
    Yang, Zhile
    Xu, Yunlang
    Li, Di
    Li, Xiaoou
    Yang, Dongsheng
    [J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2024,
  • [7] A Strengthened Dominance Relation NSGA-III Algorithm Based on Differential Evolution to Solve Job Shop Scheduling Problem
    Zeng, Liang
    Shi, Junyang
    Li, Yanyan
    Wang, Shanshan
    Li, Weigang
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2024, 78 (01): : 375 - 392
  • [8] A DQL-NSGA-III algorithm for solving the flexible job shop dynamic scheduling problem
    Tang, Hongtao
    Xiao, Yu
    Zhang, Wei
    Lei, Deming
    Wang, Jing
    Xu, Tao
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2024, 237
  • [9] A NSGA-II and NSGA-III comparison for solving an open shop scheduling problem with resource constraints
    Ciro, Guillermo Campos
    Dugardin, Frederic
    Yalaoui, Farouk
    Kelly, Russell
    [J]. IFAC PAPERSONLINE, 2016, 49 (12): : 1272 - 1277
  • [10] Performance Comparison of NSGA-II and NSGA-III on Bi-objective Job Shop Scheduling Problems
    dos Santos, Francisco
    Costa, Lino A.
    Varela, Leonilde
    [J]. OPTIMIZATION, LEARNING ALGORITHMS AND APPLICATIONS, PT I, OL2A 2023, 2024, 1981 : 531 - 543