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 条
  • [21] A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem
    Shao, Weishi
    Shao, Zhongshi
    Pi, Dechang
    SWARM AND EVOLUTIONARY COMPUTATION, 2022, 75
  • [22] An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times
    S. M. Mousavi
    I. Mahdavi
    J. Rezaeian
    M. Zandieh
    Operational Research, 2018, 18 : 123 - 158
  • [23] An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times
    Mousavi, S. M.
    Mahdavi, I.
    Rezaeian, J.
    Zandieh, M.
    OPERATIONAL RESEARCH, 2018, 18 (01) : 123 - 158
  • [24] An energy-efficient hybrid flow shop scheduling problem in steelmaking plants
    Lian, Xiaoyuan
    Zheng, Zhong
    Wang, Cheng
    Gao, Xiaoqiang
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 162
  • [25] An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem
    Qin, Hao-Xiang
    Han, Yu-Yan
    Zhang, Biao
    Meng, Lei-Lei
    Liu, Yi-Ping
    Pan, Quan-Ke
    Gong, Dun-Wei
    SWARM AND EVOLUTIONARY COMPUTATION, 2022, 69
  • [26] An improved memetic algorithm for distributed hybrid flow shop scheduling problem with operation inspection and reprocessing
    Zheng, Yu
    Peng, Ningtao
    Qi, Hao
    Gong, Guiliang
    Huang, Dan
    Zhu, Kaikai
    Liu, Jingsheng
    Liu, Gonggang
    MEASUREMENT & CONTROL, 2025, 58 (01): : 68 - 96
  • [27] An improved genetic algorithm for the re-entrant and flexible job-shop scheduling problem
    Zhang Mei
    Wu Kaihua
    PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 3399 - 3404
  • [28] A Lot Streaming Model for a Re-entrant Flow Shop Scheduling Problem with Missing Operations
    Hinze, Richard
    LOGISTICS MANAGEMENT, 2016, : 149 - 158
  • [29] Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines
    Kim, H-W
    Lee, D-H
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2009, 223 (04) : 433 - 442
  • [30] Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop
    Lin, Danping
    Lee, C. K. M.
    Ho, William
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2013, 26 (04) : 1282 - 1290