Research on Flexible Job Shop Scheduling Problem with Handling and Setup Time Based on Improved Discrete Particle Swarm Algorithm

被引:5
作者
Kong, Jili [1 ]
Wang, Zhen [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Modern Post, Beijing 100876, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2024年 / 14卷 / 06期
关键词
multi-equipment work center; flexible job shop scheduling problem; setup time; handling time; multi-objective optimization; improved discrete particle swarm optimization; MULTIOBJECTIVE GENETIC ALGORITHM; OPTIMIZATION;
D O I
10.3390/app14062586
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
With the gradual emergence of customized manufacturing, intelligent manufacturing systems have experienced widespread adoption, leading to a surge in research interests in the associated problem of intelligent scheduling. In this paper, we study the flexible job shop scheduling problem (FJSP) with setup time, handling time, and processing time in a multi-equipment work center production environment oriented toward smart manufacturing and make-to-order requirements. A mathematical model with the optimization objectives of minimizing the maximum completion time, the total number of machine adjustments, the total number of workpieces handled and the total load of the machine is constructed, and an improved discrete particle swarm algorithm based on Pareto optimization and a nonlinear adaptive inertia weighting strategy is proposed to solve the model. By integrating the model characteristics and algorithm features, a hybrid initialization method is designed to generate a higher-quality initialized population. Next, three cross-variance operators are used to implement particle position updates to maintain information sharing among particles. Then, the performance effectiveness of this algorithm is verified by testing and analyzing 15 FJSP test instances. Finally, the feasibility and effectiveness of the designed algorithm for solving multi-objective FJSPs are verified by designing an FJSP test example that includes processing time, setup time and handling time.
引用
收藏
页数:25
相关论文
共 32 条
  • [1] Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
  • [2] A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups
    Choi, IC
    Choi, DS
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2002, 42 (01) : 43 - 58
  • [3] Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints
    Dai Min
    Tang Dunbing
    Adriana, Giret
    Salido Miguel, A.
    [J]. ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2019, 59 : 143 - 157
  • [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] Staffing and scheduling under nonstationary demand for service: A literature review
    Defraeye, Mieke
    Van Nieuwenhuyse, Inneke
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2016, 58 : 4 - 25
  • [6] Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
    Ding, Haojie
    Gu, Xingsheng
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 121
  • [7] [丁舒阳 Ding Shuyang], 2018, [计算机科学, Computer Science], V45, P233
  • [8] Multi-Objective Hybrid Flow-Shop Scheduling in Parallel Sequential Mode While Considering Handling Time and Setup Time
    Feng, Yingjie
    Kong, Jili
    [J]. APPLIED SCIENCES-BASEL, 2023, 13 (06):
  • [9] Garmdare Hamid Sattari, 2018, Journal of Industrial Engineering International, V14, P55, DOI 10.1007/s40092-017-0205-y
  • [10] Han R., 2023, P GENETIC EVOLUTIONA