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 条
  • [1] A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
    Chen, Jen-Shiang
    Pan, Jason Chao-Hsien
    Lin, Chien-Min
    EXPERT SYSTEMS WITH APPLICATIONS, 2008, 34 (01) : 570 - 577
  • [2] Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints
    Geng, Kaifeng
    Liu, Li
    Wu, Zhanyong
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [3] Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints
    Kaifeng Geng
    Li Liu
    Zhanyong Wu
    Scientific Reports, 12
  • [4] A knowledge-driven memetic algorithm for the energy-efficient distributed homogeneous flow shop scheduling problem
    Xu, Yunbao
    Jiang, Xuemei
    Li, Jun
    Xing, Lining
    Song, Yanjie
    SWARM AND EVOLUTIONARY COMPUTATION, 2024, 89
  • [5] A re-entrant hybrid flow shop scheduling problem with machine eligibility constraints
    Zhang, Xiang Yi
    Chen, Lu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (16) : 5293 - 5305
  • [6] Re-entrant hybrid flow shop scheduling problem with continuous batch processing machines
    Wu X.
    Cao Z.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2022, 28 (11): : 3365 - 3378
  • [7] Hybrid tabu search for re-entrant permutation flow-shop scheduling problem
    Chen, Jen-Shiang
    Pan, Jason Chao-Hsien
    Wu, Chien-Kuang
    EXPERT SYSTEMS WITH APPLICATIONS, 2008, 34 (03) : 1924 - 1930
  • [8] A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan
    Xu, Jianyou
    Yin, Yunqiang
    Cheng, T. C. E.
    Wu, Chin-Chia
    Gu, Shusheng
    APPLIED SOFT COMPUTING, 2014, 24 : 277 - 283
  • [9] Green re-entrant hybrid flow shop scheduling problem considering multiple time factors
    Geng K.
    Ye C.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (01): : 75 - 90
  • [10] A memetic algorithm to solve uncertain energy-efficient flow shop scheduling problems
    Mariappan Kadarkarainadar Marichelvam
    Mariappan Geetha
    The International Journal of Advanced Manufacturing Technology, 2021, 115 : 515 - 530