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 条
  • [41] A Simulated Annealing Algorithm Based on Bottleneck Jobs for the Open Shop Scheduling Problem
    Zhang, Rui
    Wu, Cheng
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 4453 - 4457
  • [42] A novel hybrid genetic algorithm for the open shop scheduling problem
    Ahmadizar, Fardin
    Farahani, Mehdi Hosseinabadi
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 62 (5-8): : 775 - 787
  • [43] A novel hybrid genetic algorithm for the open shop scheduling problem
    Fardin Ahmadizar
    Mehdi Hosseinabadi Farahani
    The International Journal of Advanced Manufacturing Technology, 2012, 62 : 775 - 787
  • [44] Complexity results for flow-shop and open-shop scheduling problems with transportation delays
    Brucker, P
    Knust, S
    Cheng, TCE
    Shakhlevich, NV
    ANNALS OF OPERATIONS RESEARCH, 2004, 129 (1-4) : 81 - 106
  • [45] An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times
    Zhang, Zhi-Hai
    Bai, Danyu
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 230 : 238 - 247
  • [46] Research on open shop scheduling based on genetic algorithm
    Zhan, Yong
    Zhong, Yuguang
    Zhu, Haitao
    ENGINEERING SOLUTIONS FOR MANUFACTURING PROCESSES, PTS 1-3, 2013, 655-657 : 1670 - 1674
  • [47] Solving the open shop scheduling problem
    Dorndorf, U
    Pesch, E
    Phan-Huy, T
    JOURNAL OF SCHEDULING, 2001, 4 (03) : 157 - 174
  • [48] Improved PSO algorithm for flow shop scheduling problem with fuzzy delivery time
    Liu, Yi
    Ye, Chun-Ming
    Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, 2009, 41 (01): : 145 - 148
  • [49] Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm
    Li, Junqing
    Pan, Quan-Ke
    Suganthan, P. N.
    Tasgetiren, M. Fatih
    SWARM AND EVOLUTIONARY COMPUTATION, 2012, 7269 : 275 - 282
  • [50] A Quantum-PSO Algorithm for No-Wait Flow shop Scheduling Problem
    Chang, Junlin
    An, Fengshuan
    Su, Pizhao
    2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5, 2010, : 179 - +