Hybrid Flow-Shop Scheduling Problems with Missing and Re-Entrant Operations Considering Process Scheduling and Production of Energy Consumption

被引:3
|
作者
Tang, Hongtao [1 ]
Zhou, Jiahao [1 ]
Shao, Yiping [1 ]
Yang, Zhixiong [2 ]
机构
[1] Zhejiang Univ Technol, Inst Ind Engn, Coll Mech Engn, Hangzhou 310023, Peoples R China
[2] Jiaxing Sudoku Bridge Technol Co Ltd, Jiaxing 314599, Peoples R China
关键词
hybrid flow-shop scheduling problem; missing operation; re-entry; genetic algorithm; energy consumption; SHOP; TIME; SEARCH; ALGORITHM; 2-STAGE; COST;
D O I
10.3390/su15107982
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
A hybrid flow shop scheduling model with missing and re-entrant operations was designed to minimize the maximum completion time and the reduction in energy consumption. The proposed dual-population genetic algorithm was enhanced with a range of improvements, which include the design of a three-layer gene coding method, hierarchical crossover and mutation techniques, and the development of an adaptive operator that considered gene similarity and chromosome fitness values. The optimal and worst individuals were exchanged between the two subpopulations to improve the exploration ability of the algorithm. An orthogonal experiment was performed to obtain the optimal horizontal parameter set of the algorithm. Furthermore, an experiment was conducted to compare the proposed algorithm with a basic genetic algorithm, particle swarm optimization algorithm, and ant colony optimization, which were all performed on the same scale. The experimental results show that the fitness value of the proposed algorithm is above 15% stronger than the other 4 algorithms on a small scale, and was more than 10% stronger than the other 4 algorithms on a medium and large scale. Under the condition close to the actual scale, the results of ten repeated calculations showed that the proposed algorithm had higher robustness.
引用
收藏
页数:19
相关论文
共 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] 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
  • [3] A Lot Streaming Model for a Re-entrant Flow Shop Scheduling Problem with Missing Operations
    Hinze, Richard
    LOGISTICS MANAGEMENT, 2016, : 149 - 158
  • [4] 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
  • [5] A model for a Special Re-entrant Flow Shop Scheduling
    Cai, Yue
    Wang, Jian
    Li, Hua
    2010 INTERNATIONAL CONFERENCE ON INFORMATION, ELECTRONIC AND COMPUTER SCIENCE, VOLS 1-3, 2010, : 1887 - 1891
  • [6] Study on re-entrant flow-shop scheduling problem (optimization by mixed integer programming)
    Hino, R. (hino@mech.nagoya-u.ac.jp), 1600, Japan Society of Mechanical Engineers (79):
  • [7] Minimizing total completion time for re-entrant flow shop scheduling problems
    Jing, Caixia
    Huang, Wanzhen
    Tang, Guochun
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (48) : 6712 - 6719
  • [8] 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
  • [9] Hybrid flow-shop scheduling with assembly operations
    Yokoyama, M
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 73 (02) : 103 - 116
  • [10] Integer programming models for the re-entrant shop scheduling problems
    Chen, Jen-Shiang
    Pan, Jason Chao-Hsien
    ENGINEERING OPTIMIZATION, 2006, 38 (05) : 577 - 592