An Improved MOEA/D Algorithm for the Carbon Black Production Line Static and Dynamic Multiobjective Scheduling Problem

被引:0
作者
Wang, Yao [1 ]
Dong, Zhiming [2 ]
Hu, Tenghui [3 ]
Wang, Xianpeng [4 ]
机构
[1] Northeastern Univ, Minist Educ, Key Lab Data Analyt & Optimizat Smart Ind, Shenyang, Peoples R China
[2] Northeastern Univ, Liaoning Engn Lab Operat Analyt & Optimizat Smart, Shenyang, Peoples R China
[3] Northeastern Univ, Liaoning Key Lab Mfg Syst & Logist, Shenyang, Peoples R China
[4] Northeastern Univ, Inst Ind & Syst Engn, Shenyang, Peoples R China
来源
2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2020年
基金
中国国家自然科学基金; 国家自然科学基金重大项目;
关键词
MTO; order static scheduling; rush order dynamic rescheduling; multiobjecfive optimization; MOEA/D;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The make-to-order (MTO) manufacturers generally make production plans based on orders, which can help enterprises effectively avoid market risks, reduce market pressure and improve competitiveness. However, due to the characteristics of MTO production mode, the order static scheduling problem and rush order dynamic rescheduling problem have become more and more important for these MTO manufacturers. Therefore, in this paper, we take the packaging production line of a typical carbon black production enterprise as the research background to study the carbon black production line static and dynamic multiobjective scheduling problem. Firstly, multiobjective optimization models of both order static scheduling and rush order dynamic rescheduling are established. Then the improved MOEA/D algorithm combined the heuristic algorithm based on heuristic rules and discrete dynamic local search is developed to solve these two models. Based on the actual production data, eight instances of order static scheduling problems of different scales and four instances of rush order dynamic rescheduling problems of different scales are constructed respectively. Experimental results illustrate that the improved MOEA/D is effective and superior in solving these two problems.
引用
收藏
页数:8
相关论文
共 14 条
  • [1] Alhindi A, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P1155, DOI 10.1109/CEC.2014.6900413
  • [2] A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM
    BRUCKER, P
    JURISCH, B
    SIEVERS, B
    [J]. DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) : 107 - 127
  • [3] MOEA/D for Flowshop Scheduling Problems
    Chang, Pei Chann
    Chen, Shih Hsin
    Zhang, Qingfu
    Lin, Jun Lin
    [J]. 2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1433 - +
  • [4] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [5] Dell'Amico M., 1993, Annals of Operations Research, V41, P231, DOI 10.1007/BF02023076
  • [6] Integrating rush orders into existent schedules for a complex job shop problem
    Moratori, Patrick
    Petrovic, Sanja
    Vazquez-Rodriguez, Jose Antonio
    [J]. APPLIED INTELLIGENCE, 2010, 32 (02) : 205 - 215
  • [7] A discrete differential evolution algorithm for the permutation flowshop scheduling problem
    Pan, Quan-Ke
    Tasgetiren, Mehmet Fatih
    Liang, Yun-Chia
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55 (04) : 795 - 816
  • [8] Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization
    Schuetze, Oliver
    Esquivel, Xavier
    Lara, Adriana
    Coello Coello, Carlos A.
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2012, 16 (04) : 504 - 522
  • [9] Adaptive Multiobjective Differential Evolution With Reference Axis Vicinity Mechanism
    Tang, Lixin
    Wang, Xianpeng
    Dong, Zhiming
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (09) : 3571 - 3585
  • [10] Rescheduling manufacturing systems: A framework of strategies, policies, and methods
    Vieira, GE
    Herrmann, JW
    Lin, E
    [J]. JOURNAL OF SCHEDULING, 2003, 6 (01) : 39 - 62