An Improved Imperialist Competitive Algorithm for Reentrant Flow Shop Scheduling

被引：0
|
作者：
Cheng, Yong [1 ]
Lei, Deming [1 ]
机构：
[1] Wuhan Univ Technol, Sch Automat, Wuhan, Hubei, Peoples R China
来源：
2018 37TH CHINESE CONTROL CONFERENCE (CCC) | 2018年
基金：
中国国家自然科学基金;
关键词：
Reentrant; Flow shop scheduling; Multi-objective optimization; Imperialist competitive algorithm; GENETIC ALGORITHM; MINIMIZING MAKESPAN; SEARCH;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This study considers chain reentrant flow shop scheduling problem which exists in real-world industries. Each job visits all machines in a fixed order and return back to the first machine for its last operation. The goal of the problem is to decide the processing sequence of jobs on each machine in order to minimize makespan and total tardiness simultaneously. An improved imperialist competitive algorithm (IICA) is proposed, in which new solutions are generated by the revolution of imperialists, assimilation and revolution of colonies. Some new strategies are also adopted to construct initial empires and implement imperialist competition. A number of experiments are conducted to test the performance of IICA. The computational results demonstrate that IICA can provide promising results for the considered problem.
引用
收藏
页码：2206 / 2211
页数：6
相关论文
共 50 条
  • [41] Integrated process planning and scheduling using an imperialist competitive algorithm
    Lian, Kunlei
    Zhang, Chaoyong
    Gao, Liang
    Li, Xinyu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (15) : 4326 - 4343
  • [42] Reentrant hybrid flow shop scheduling based on cooperated shuffled frog-leaping algorithm
    Lei D.
    Liu J.
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2023, 51 (05): : 125 - 130
  • [43] Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm
    Cho, Hang-Min
    Bae, Suk-Joo
    Kim, Jungwuk
    Jeong, In-Jae
    COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (03) : 529 - 541
  • [44] Improved immune Genetic Algorithm for solving flow shop scheduling problem
    Liu, M.
    Pang, W.
    Wang, K. P.
    Song, Y. Z.
    Zhou, C. G.
    COMPUTATIONAL METHODS, PTS 1 AND 2, 2006, : 1057 - +
  • [45] An improved evolutionary algorithm based on heuristic rules for flow shop scheduling
    Niu, Qun
    Gu, Xing-Sheng
    Huadong Ligong Daxue Xuebao /Journal of East China University of Science and Technology, 2006, 32 (12): : 1472 - 1477
  • [46] Improved Hormone Algorithm for Solving the Permutation Flow Shop Scheduling Problem
    Zheng K.
    Lian Z.
    Wang Y.
    Zhu C.
    Gu X.
    Liu X.
    Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2022, 51 (06): : 890 - 903
  • [47] An Improved Quantum Differential Algorithm for Stochastic Flow Shop Scheduling Problem
    Jiao, Bin
    Gu, Xingsheng
    Cu, Jinwei
    2009 IEEE INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION, VOLS 1-3, 2009, : 1235 - +
  • [48] Reentrant Flow Shop Scheduling considering Multiresource Qualification Matching
    Chu, Feng
    Liu, Ming
    Liu, Xin
    Chu, Chengbin
    Jiang, Juan
    SCIENTIFIC PROGRAMMING, 2018, 2018
  • [49] Reentrant hybrid flow shop scheduling problem with renewable energy
    Dong J.
    Ye C.
    Wan M.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2022, 28 (04): : 1112 - 1128
  • [50] A new method for solving the open shop scheduling using imperialist competitive algorithm and tabu search with regard to maintenance of machine
    Baygan, Marzieh
    Baygan, Mahboubeh
    2015 2ND INTERNATIONAL CONFERENCE ON KNOWLEDGE-BASED ENGINEERING AND INNOVATION (KBEI), 2015, : 972 - 977
12345