A Self-braking Symbiotic Organisms Search Algorithm for Bi-objective Reentrant Hybrid Flow Shop Scheduling Problem

被引:0
|
作者
Cao, Zhengcai [1 ]
Gong, Sikai [1 ]
Zhou, Meng [1 ]
Liu, Kaiwen [1 ]
机构
[1] Beijing Univ Chem Technol, Coll Informat Sci & Technol, Beijing 100029, Peoples R China
基金
中国国家自然科学基金;
关键词
GENETIC ALGORITHM; CRITERION;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The bi-objective reentrant hybrid flow shop problem (BRHFSP) is a typical NP-hard scheduling case in a semiconductor wafer fabrication. In this paper, a self-braking Symbiotic Organisms Search algorithm (SSOS) is proposed to minimize the total tardiness and makespan of this problem. A discrete multi-objective Symbiotic Organisms Search is selected to reduce the wasted time of adjusting excessive parameters in most evolutionary algorithms. This algorithm has a brief structure with no control parameters. Moreover, the entropy-based termination criterion is added to multi-objective Symbiotic Organisms Search to decrease the computation burden. In this way, an entropy-based dissimilarity measure criterion is generated to help our algorithm stop automatically with the increase of iterations. Numerical test results in many cases demonstrate that SSOS is effective for BRHFSP.
引用
收藏
页码:803 / 808
页数:6
相关论文
共 50 条
  • [1] Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm
    Cho, Hang-Min
    Bae, Suk-Joo
    Kim, Jungwuk
    Jeong, In-Jae
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (03) : 529 - 541
  • [2] Hybrid symbiotic organisms search algorithm for permutation flow shop scheduling problem
    Qin, Xuan
    Fang, Zi-Han
    Zhang, Zhao-Xin
    [J]. Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2020, 54 (04): : 712 - 721
  • [3] Bi-objective hybrid flow shop scheduling: a new local search
    Mousavi, S. M.
    Mousakhani, M.
    Zandieh, M.
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 64 (5-8): : 933 - 950
  • [4] Bi-objective hybrid flow shop scheduling: a new local search
    S. M. Mousavi
    M. Mousakhani
    M. Zandieh
    [J]. The International Journal of Advanced Manufacturing Technology, 2013, 64 : 933 - 950
  • [5] An Immune-PSO Algorithm for Bi-objective Flow Shop Scheduling Problem
    Chang Junlin
    Liang Junyan
    Wei Wei
    [J]. 2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 2115 - 2118
  • [6] A Pareto-Based Discrete Harmony Search Algorithm for Bi-objective Reentrant Hybrid Flowshop Scheduling Problem
    Shen, Jingnan
    Wang, Ling
    Deng, Jin
    Zheng, Xiaolong
    [J]. HARMONY SEARCH ALGORITHM, 2016, 382 : 435 - 445
  • [7] Solving bi-objective flow shop problem with hybrid path relinking algorithm
    Zeng, Rong-Qiang
    Basseur, Matthieu
    Hao, Jin-Kao
    [J]. APPLIED SOFT COMPUTING, 2013, 13 (10) : 4118 - 4132
  • [8] Bi-objective hybrid flow shop scheduling with common due date
    Li, Zhi
    Zhong, Ray Y.
    Barenji, Ali Vatankhah
    Liu, J. J.
    Yu, C. X.
    Huang, George Q.
    [J]. OPERATIONAL RESEARCH, 2021, 21 (02) : 1153 - 1178
  • [9] A simheuristic for bi-objective stochastic permutation flow shop scheduling problem
    Maria Gonzalez-Neira, Eliana
    Rafael Montoya-Torres, Jairo
    [J]. JOURNAL OF PROJECT MANAGEMENT, 2019, 4 (02) : 57 - 80
  • [10] Bi-objective hybrid flow shop scheduling with common due date
    Zhi Li
    Ray Y. Zhong
    Ali Vatankhah Barenji
    J. J. Liu
    C. X. Yu
    George Q. Huang
    [J]. Operational Research, 2021, 21 : 1153 - 1178