A DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM TO MAXIMIZING PRODUCTION

被引：0
|
作者：
Lian, Zhigang [1 ]
Lin, Weitian [2 ]
Gao, Yejun [2 ]
Jiao, Bin [2 ]
机构：
[1] Shanghai Dianji Univ, Sch Elect & Informat Engn, 1350 Ganlan Rd, Shanghai 201306, Peoples R China
[2] Shanghai Dianji Univ, Sch Elect Engn, Shanghai 201306, Peoples R China
来源：
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL | 2014年 / 10卷 / 02期
关键词：
Job-shop scheduling; Due-date; Maximizing; Production volume; Discrete particle swarm optimization algorithm;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper researches on a special job-shop scheduling problem meeting capabilities of equipments and different due-dates. Its model is developed, which can accord process capacity and different due-dates in numerous jobs to select some to process, and the objective is as far as possible to maximize output. In order to solve complex scheduling problems proposed in this paper, a discrete particle swarm optimization algorithm is presented to optimize it. To test the performance of the novel algorithm, we use some randomly generated instances to simulate solving the practical problems. Computational experiments show significant improvement over an existing particle swarm optimization algorithm.
引用
收藏
页码：729 / 740
页数：12
相关论文
共 50 条
  • [41] Quantum particle swarm optimization with chaotic encoding schemes for flexible job-shop scheduling problem
    Xu, Yuanxing
    Wang, Deguang
    Zhang, Mengjian
    Yang, Ming
    Liang, Chengbin
    SWARM AND EVOLUTIONARY COMPUTATION, 2025, 93
  • [42] A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES
    Pongchairerks, Pisut
    Kachitvichyanukul, Voratas
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2009, 26 (02) : 161 - 184
  • [43] A new hybrid optimization algorithm for the job-shop scheduling problem
    Xia, WJ
    Wu, ZM
    Zhang, W
    Yang, GK
    PROCEEDINGS OF THE 2004 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2004, : 5552 - 5557
  • [44] A hybrid particle swarm optimization for job shop scheduling problem
    Sha, D. Y.
    Hsu, Cheng-Yu
    COMPUTERS & INDUSTRIAL ENGINEERING, 2006, 51 (04) : 791 - 808
  • [45] Hybrid Particle Swarm Algorithm Applied to Flexible Job-Shop Problem
    Cavalca, Diego L.
    Fernandes, Ricardo A. S.
    2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 2477 - 2482
  • [46] Investigation of particle swarm optimization for job shop scheduling problem
    Liu, Zhixiong
    ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 3, PROCEEDINGS, 2007, : 799 - 803
  • [47] Job-Shop Scheduling Based on Improved Particle Swarm
    Chen, Qun-xian
    FUZZY INFORMATION AND ENGINEERING, VOLUME 2, 2009, 62 : 97 - 105
  • [48] Improved New Particle Swarm Algorithm Solving Job Shop Scheduling Optimization Problem
    Liu, Xiaobing
    Jiao, Xuan
    Li, Yanpeng
    Liang, Xu
    2013 3RD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), 2013, : 148 - 150
  • [49] 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
  • [50] A novel particle swarm optimization-based approach for job-shop scheduling
    Ge, H. W.
    Lu, Y. H.
    Zhou, Y.
    Guo, X. C.
    Liang, Y. C.
    COMPUTATIONAL METHODS, PTS 1 AND 2, 2006, : 1093 - +
12345