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 条
  • [1] Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm
    顾文斌
    唐敦兵
    郑堃
    Transactions of Nanjing University of Aeronautics and Astronautics, 2014, 31 (05) : 559 - 567
  • [2] A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
    Lian, Zhigang
    Jiao, Bin
    Gu, Xingsheng
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 183 (02) : 1008 - 1017
  • [3] General particle swarm optimization algorithm for job-shop scheduling problem
    Sch. of Mechanical Sci. and Eng., Huazhong Univ. of S and T, Wuhan 430074, China
    Jisuanji Jicheng Zhizao Xitong, 2006, 6 (911-917+923):
  • [4] Study and Application of an Improved Particle Swarm Optimization in Job-Shop Scheduling Problem
    Ying Mingfeng
    PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON EDUCATION TECHNOLOGY AND COMPUTER SCIENCE, VOL I, 2009, : 971 - 974
  • [5] An effective particle swarm optimization algorithm for flexible job-shop scheduling problem
    Nouiri, Maroua
    Jemai, Abderezak
    Ammari, Ahmed Chiheb
    Bekrar, Abdelghani
    Niar, Smail
    PROCEEDINGS OF 2013 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IEEE-IESM 2013), 2013, : 29 - 34
  • [6] A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan
    Lian, Zhigang
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2010, 2010
  • [7] A DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM TO MAXIMIZING PRODUCTION
    Lian, Zhigang
    Lin, Weitian
    Gao, Yejun
    Jiao, Bin
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2014, 10 (02): : 729 - 740
  • [8] An Improved Gaming Particle Swarm Optimization Algorithm for Flexible Job-shop Scheduling Problems
    Gu X.
    Ding H.
    Ding, Haojie (hero_ding1978@163.com), 1782, Science Press (48): : 1782 - 1789
  • [9] An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem
    Nouiri, Maroua
    Bekrar, Abdelghani
    Jemai, Abderezak
    Niar, Smail
    Ammari, Ahmed Chiheb
    JOURNAL OF INTELLIGENT MANUFACTURING, 2018, 29 (03) : 603 - 615
  • [10] A new algorithm for flexible job-shop scheduling problem based on particle swarm optimization
    Teekeng W.
    Thammano A.
    Unkaw P.
    Kiatwuthiamorn J.
    Artificial Life and Robotics, 2016, 21 (01) : 18 - 23