A Hybrid Particle Swarm Optimization Method for Permutation Flow Shop Scheduling Problem

被引:0
|
作者
Wang, Lin [1 ]
Qu, Jianhua [1 ]
Zheng, Yuyan [1 ]
机构
[1] Shandong Normal Univ, Sch Management Sci & Engn, Jinan 250014, Shandong, Peoples R China
来源
关键词
Permutation Flow Shop Scheduling Problem; Particle Swarm Optimization; NEH algorithm; Makespan; ALGORITHM;
D O I
10.1007/978-3-319-15554-8_38
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Permutation Flow Shop Scheduling Problem (PFSP) is a typical example in Production Scheduling, which has attracted many researchers' attention. This paper takes to the advantage of the swarm characteristic of Particle Swarm optimization (PSO) algorithm to find the best particle in the solution space. The objective is to minimize the makespan. Firstly, the initial solution of the algorithm is generated by the famous heuristic NEH algorithm. The NEH algorithm was used to initialize the particle of global extreme values. Secondly, we take some optimized strategy to set the parameters, acceleration constant and nonlinear inertia weight strategy which based on random self-adaptively by means of chaos method for setting parameters. These optimized methods can avoid algorithm to be trapped in local optimum. At last, simulated results demonstrate that the hybrid PSO method is feasible and effective for the PFSP.
引用
收藏
页码:465 / 476
页数:12
相关论文
共 50 条
  • [31] An effective hybrid particle swarm optimization for no-wait flow shop scheduling
    Bo Liu
    Ling Wang
    Yi-Hui Jin
    The International Journal of Advanced Manufacturing Technology, 2007, 31 : 1001 - 1011
  • [32] Hybrid particle swarm optimization for flow shop scheduling with stochastic processing time
    Liu, B
    Wang, L
    Jin, YH
    COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS, 2005, 3801 : 630 - 637
  • [33] A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
    Lian, Zhigang
    Gu, Xingsheng
    Jiao, Bin
    CHAOS SOLITONS & FRACTALS, 2008, 35 (05) : 851 - 861
  • [34] A Hybrid Genetic Algorithm and Particle Swarm Optimization for Flow Shop Scheduling Problems
    Alvarez Pomar, Lindsay
    Cruz Pulido, Elizabeth
    Tovar Roa, Julian Dario
    APPLIED COMPUTER SCIENCES IN ENGINEERING, 2017, 742 : 601 - 612
  • [35] An effective hybrid particle swarm optimization for no-wait flow shop scheduling
    Liu, Bo
    Wang, Ling
    Jin, Yi-Hui
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 31 (9-10): : 1001 - 1011
  • [36] Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks
    Chou, Fuh-Der
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) : 137 - 145
  • [37] A Hybrid Algorithm for a Robust Permutation Flow Shop Scheduling Problem
    Ni, Zhengbin
    Wang, Bing
    Wu, Bo
    PROCEEDINGS OF THE 32ND 2020 CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2020), 2020, : 3802 - 3807
  • [38] 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
  • [39] A neighbourhood property for the job shop scheduling problem with application to hybrid particle swarm optimization
    Zhang, Rui
    Wu, Cheng
    IMA JOURNAL OF MANAGEMENT MATHEMATICS, 2013, 24 (01) : 111 - 134
  • [40] A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Pan, Quan-Ke
    Wang, Ling
    Tasgetiren, M. Fatih
    Zhao, Bao-Hua
    1600, Springer London (38): : 3 - 4