PSO based scheduling algorithm for open-shop scheduling problem

被引:0
|
作者
Department of Industrial and Manufacturing System Engineering, Huazhong University of Science and Technology, Wuhan 430074, China [1 ]
机构
来源
Jixie Gongcheng Xuebao | 2006年 / 2卷 / 129-134期
关键词
Algorithms - Applications - Artificial intelligence - Computer simulation - Convergence of numerical methods - Information use - Manufacture - Mathematical models - Optimization - Testing;
D O I
10.3901/JME.2006.02.129
中图分类号
学科分类号
摘要
Open-shop scheduling problem (OSP) is an important scheduling problem and has wide engineering applications in manufacturing. Optimization algorithms are important research content in scheduling theory. Artificial intelligence based meta-heuristic algorithms are effective methods for this problem. A new meta-heuristic based on particle swarm optimization (PSO) is proposed to obtain optimized open shop schedule. First, the limitation of information sharing mechanism in PSO model is discussed, and then new information sharing mechanism based on swarm intelligence is put forward. Based on the new information sharing mechanism, a new PSO based on scheduling algorithm-PSO-OSP is proposed. The proposed algorithm utilizes neighborhood knowledge to direct its local search procedure which can overcome the blindness or randomness introduced by meta-heuristics. Finally, OSP benchmarks are used to test its efficiency. Simulation results show that the new proposed algorithm can improve the convergence speed and obtain optimized open shop schedules.
引用
收藏
相关论文
共 50 条
  • [1] Extended Genetic Algorithm for solving open-shop scheduling problem
    Ali Asghar Rahmani Hosseinabadi
    Javad Vahidi
    Behzad Saemi
    Arun Kumar Sangaiah
    Mohamed Elhoseny
    Soft Computing, 2019, 23 : 5099 - 5116
  • [2] Extended Genetic Algorithm for solving open-shop scheduling problem
    Hosseinabadi, Ali Asghar Rahmani
    Vahidi, Javad
    Saemi, Behzad
    Sangaiah, Arun Kumar
    Elhoseny, Mohamed
    SOFT COMPUTING, 2019, 23 (13) : 5099 - 5116
  • [3] THE CYCLIC COMPACT OPEN-SHOP SCHEDULING PROBLEM
    MAHADEV, NVR
    SOLOT, P
    DEWERRA, D
    DISCRETE MATHEMATICS, 1993, 111 (1-3) : 361 - 366
  • [4] Preemptive Open-shop Scheduling: Network Flow based Algorithm
    Zhan, Y.
    Zhong, Y. G.
    Zhu, H. T.
    DIGITAL DESIGN AND MANUFACTURING TECHNOLOGY II, 2011, 215 : 111 - 114
  • [6] Hybrid Genetic Algorithms for the Open-Shop Scheduling Problem
    Kokosinski, Zbigniew
    Studzienny, Lukasz
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (09): : 136 - 145
  • [7] Competitive genetic algorithms for the open-shop scheduling problem
    Christian Prins
    Mathematical Methods of Operations Research, 2000, 52 : 389 - 411
  • [8] Competitive genetic algorithms for the open-shop scheduling problem
    Prins, C
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2000, 52 (03) : 389 - 411
  • [9] A two-level particle swarm optimisation algorithm for open-shop scheduling problem
    Pongchairerks, Pisut
    Kachitvichyanukul, Voratas
    INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2016, 7 (06) : 575 - 585
  • [10] AN ALGORITHM FOR THE OPEN-SHOP PROBLEM
    FIALA, T
    MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (01) : 100 - 109