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 条
  • [21] A Hybrid PSO/GA Algorithm for Job Shop Scheduling Problem
    Tang, Jianchao
    Zhang, Guoji
    Lin, Binbin
    Zhang, Bixi
    ADVANCES IN SWARM INTELLIGENCE, PT 1, PROCEEDINGS, 2010, 6145 : 566 - +
  • [22] A heuristic for the two-machine open-shop scheduling problem with transportation times
    Strusevich, VA
    DISCRETE APPLIED MATHEMATICS, 1999, 93 (2-3) : 287 - 304
  • [23] On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
    Bai, Danyu
    Zhang, Zhihai
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2014, 45 (08) : 1657 - 1667
  • [24] Adaptive Open-Shop Scheduling for Optical Interconnection Networks
    Dung Pham Van
    Fiorani, Matteo
    Wosinska, Lena
    Chen, Jiajia
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 2017, 35 (13) : 2503 - 2513
  • [25] A tabu search algorithm for the open shop scheduling problem
    Liaw, CF
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (02) : 109 - 126
  • [26] A hybrid genetic algorithm for the open shop scheduling problem
    Liaw, CF
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 124 (01) : 28 - 42
  • [27] A Memetic Algorithm to Solve the Open Shop Scheduling Problem
    Engin, Batuhan Eren
    Sumbul, Mehmet Onur
    Engin, Orhan
    Baysal, Mehmet Emin
    Sarucan, Ahmet
    2015 6TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION, AND APPLIED OPTIMIZATION (ICMSAO), 2015,
  • [28] The Open Shop Scheduling Problem
    Woeginger, Gerhard J.
    35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
  • [29] Scheduling algorithm for the Job Shop Scheduling Problem
    Cruz-Chavez, Marco Antonio
    Martinez-Rangel, Martin G.
    Hernandez, J. A.
    Zavala-Diaz, Jose Crispin
    Diaz-Parra, Ocotlan
    CERMA 2007: ELECTRONICS, ROBOTICS AND AUTOMOTIVE MECHANICS CONFERENCE, PROCEEDINGS, 2007, : 336 - +
  • [30] Open-Shop Scheduling for Unit Jobs Under Precedence Constraints
    Zhang, An
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2018), 2018, 11346 : 329 - 340