Minimizing makespan in Job-shop Scheduling Problem Using an Improved Adaptive Particle Swarm Optimization Algorithm

被引:0
|
作者
Gu, Wenbin [1 ]
Tang, Dunbing [1 ]
Zheng, Kun [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Mech & Elect Engn, Nanjing 210016, Peoples R China
关键词
Job-shop scheduling problem ([!text type='JS']JS[!/text]P); Hormone modulation mechanism; Improved adaptive particle swarm optimization algorithm (IAPSO); minimum makespan; TABU SEARCH;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes an improved adaptive particle swarm optimization algorithm (IAPSO) for the minimization of makespan in job shop scheduling problems (JSP). Inspired by hormone modulation mechanism, an adaptive hormonal factor (HF) is designed to be used in the updating equations of particle swarm. Using the HF, each particle of the swarm can adjust its particle position self-adaptively to avoid the premature phenomena and get better solution. Computational experiments demonstrate that the proposed IAPSO reaches high-quality solutions in short computational times. By employing IAPSO, machines can be used more efficiently, which means tasks can be allocated appropriately, production efficiency can be improved, and the production cycle can be shortened efficiently.
引用
收藏
页码:3189 / 3193
页数:5
相关论文
共 50 条
  • [21] The Application of Improved Hybrid Particle Swarm Optimization Algorithm in Job Shop Scheduling Problem
    Huang, Ming
    Liu, Qingsong
    Liang, Xu
    PROCEEDINGS OF 2019 IEEE 7TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2019), 2019, : 49 - 52
  • [22] Hybrid of human learning optimization algorithm and particle swarm optimization algorithm with scheduling strategies for the flexible job-shop scheduling problem
    Ding, Haojie
    Gu, Xingsheng
    NEUROCOMPUTING, 2020, 414 (414) : 313 - 332
  • [23] A Discrete Particle Swarm Optimization Algorithm With Adaptive Inertia Weight for Solving Multiobjective Flexible Job-shop Scheduling Problem
    Gu, Xiao-Lin
    Huang, Ming
    Liang, Xu
    IEEE ACCESS, 2020, 8 : 33125 - 33136
  • [24] A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS
    Ge, H. W.
    Liang, Y. C.
    Zhou, Y.
    Guo, X. C.
    INTERNATIONAL JOURNAL OF COMPUTATIONAL METHODS, 2005, 2 (03) : 419 - 430
  • [25] A dual similar particle swarm optimization algorithm for job-shop scheduling with penalty
    Lian, Zhigang
    Gu, Xingsheng
    Jiao, Bin
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 7312 - 7316
  • [26] An improved hybrid particle swarm optimization for multi-objective flexible job-shop scheduling problem
    Zhang, Yi
    Zhu, Haihua
    Tang, Dunbing
    KYBERNETES, 2020, 49 (12) : 2873 - 2892
  • [27] An Improved Multi-Population Hybrid Particle Swarm Optimization for Flexible Job-Shop Scheduling Problem
    Chen, Wen-xian
    Luo, De-lin
    Guo, Jian-min
    Chen, Jin
    PROCEEDING OF THE 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT TECHNOLOGIES, 2009, : 620 - 624
  • [28] Improved Collaborative Particle Swarm Algorithm for Job Shop Scheduling Optimization
    Liu, Aijun
    Yang, Yu
    Xing, Qingsong
    Yao, Hao
    Zhang, Yudong
    Zhou, Zhenyu
    ADVANCED SCIENCE LETTERS, 2011, 4 (6-7) : 2180 - 2183
  • [29] A hybrid particle swarm optimization algorithm for bi-criteria flexible job-shop scheduling problem
    Li, Junqing
    Pan, Quanke
    Xie, Shengxian
    Liang, Jing
    Zheng, Liping
    Gao, Kaizhou
    2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5, 2010, : 1537 - +
  • [30] Particle swarm optimization algorithm for flexible job shop scheduling problem
    Liu, Zhixiong
    Yang, Guangxiang
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2007, 14 : 327 - 333