A memetic algorithm for energy-efficient distributed re-entrant hybrid flow shop scheduling problem

被引:21
|
作者
Geng, Kaifeng [1 ,2 ]
Ye, Chunming [1 ]
机构
[1] Univ Shanghai Sci & Technol, Sch Business, Shanghai, Peoples R China
[2] Nanyang Inst Technol, Informat Construct & Management Ctr, Nanyang, Henan, Peoples R China
基金
中国国家自然科学基金;
关键词
Energy-efficient; memetic algorithm; Time-of-Use electricity price; distributed re-entrant hybrid flow shop scheduling; customer order constraints; MINIMIZING MAKESPAN; SINGLE-MACHINE;
D O I
10.3233/JIFS-202963
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Facing the worsening environmental problems, green manufacturing and sustainable development have attracted much attention Aiming at the energy-efficient distributed re-entrant hybrid flow shop scheduling problem considering the customer order constraints (EDORHFSP) under Time-of-Use (TOU) electricity price, a mathematical model is established to minimize the maximum completion time and total consumption energy cost. In the study, some customer orders require production in multiple factories and jobs belonging to the same customer order must be processed in one factory. Firstly, a memetic algorithm (MA) was proposed to solve the problem. To improve the performance of the algorithm, encoding and decoding methods, energy cost saving procedure, three heuristic rules about the population initialization and some neighborhood search methods are designed. Then, Taguchi method is adopted to research the influence of parameters setting. Lastly, numerical experiments demonstrate the effectiveness and superiority of MA for the EDORHFSP.
引用
收藏
页码:3951 / 3971
页数:21
相关论文
共 50 条
  • [31] Re-entrant flow shop scheduling problem with time windows using hybrid genetic algorithm based on auto-tuning strategy
    Chamnanlor, Chettha
    Sethanan, Kanchana
    Chien, Chen-Fu
    Gen, Mitsuo
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (09) : 2612 - 2629
  • [32] An effective hybrid collaborative algorithm for energy-efficient distributed permutation flow-shop inverse scheduling
    Mou, Jianhui
    Duan, Peiyong
    Gao, Liang
    Liu, Xinhua
    Li, Junqing
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2022, 128 : 521 - 537
  • [33] Hybrid Simulation and GA for a Flexible Flow Shop Problem with Variable Processors and Re-entrant Flow
    Mendez-Giraldo, German
    Alvarez-Pomar, Lindsay
    Franco, Carlos
    APPLIED COMPUTER SCIENCES IN ENGINEERING, WEA 2018, PT I, 2018, 915 : 246 - 256
  • [34] An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers
    Luo, Qiang
    Deng, Qianwang
    Gong, Guiliang
    Zhang, Like
    Han, Wenwu
    Li, Kexin
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 160
  • [35] A reinforcement learning based memetic algorithm for energy-efficient distributed two-stage flexible job shop scheduling problem
    Geng, Kaifeng
    Liu, Li
    Wu, Shaoxing
    SCIENTIFIC REPORTS, 2024, 14 (01):
  • [36] Modeling and optimization for energy-efficient hybrid flow-shop scheduling problem
    Ren C.
    Yang X.
    Zhang C.
    Meng L.
    Hong H.
    Yu J.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2019, 25 (08): : 1965 - 1980
  • [37] A heuristic algorithm for two-machine re-entrant shop scheduling
    Drobouchevitch, IG
    Strusevich, VA
    ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) : 417 - 439
  • [38] Hybrid Flow-Shop Scheduling Problems with Missing and Re-Entrant Operations Considering Process Scheduling and Production of Energy Consumption
    Tang, Hongtao
    Zhou, Jiahao
    Shao, Yiping
    Yang, Zhixiong
    SUSTAINABILITY, 2023, 15 (10)
  • [39] Evolutionary Multitasking Memetic Algorithm for Distributed Hybrid Flow-Shop Scheduling Problem With Deterioration Effect
    Liu, Huan
    Zhao, Fuqing
    Wang, Ling
    Xu, Tianpeng
    Dong, Chenxing
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2024, : 1 - 15
  • [40] A new mathematical formulation and a hybrid evolutionary algorithm for re-entrant flow-shop problem with release date
    Behmanesh, R.
    Kianfar, K.
    SCIENTIA IRANICA, 2024, 31 (06) : 500 - 517