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 条
  • [41] A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Quan-Ke Pan
    Ling Wang
    M. Fatih Tasgetiren
    Bao-Hua Zhao
    The International Journal of Advanced Manufacturing Technology, 2008, 38 : 337 - 347
  • [42] 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
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 38 (3-4): : 337 - 347
  • [43] A new particle swarm optimization for the open shop scheduling problem
    Sha, D. Y.
    Hsu, Cheng-Yu
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3243 - 3261
  • [44] An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem
    Zhang, Changsheng
    Sun, Jigui
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (03) : 5162 - 5167
  • [45] A hybrid discrete particle swarm optimization algorithm to solve flow shop scheduling problems
    Chandrasekaran, S.
    Ponnambalam, S. G.
    Suresh, R. K.
    Vijayakumar, N.
    2006 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2006, : 528 - +
  • [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] Flexible Flow-shop Scheduling Approach Based on Hybrid Particle Swarm Optimization
    Ou, Wei
    Zou, Fengxing
    Gao, Zheng
    2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 1013 - 1018
  • [48] A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
    Tseng, Chao-Tang
    Liao, Ching-Jong
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (17) : 4655 - 4670
  • [49] A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem
    Liu, Hongcheng
    Gao, Liang
    Pan, Quanke
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (04) : 4348 - 4360
  • [50] Scheduling of Flow Shop Production Systems with Particle Swarm Optimization
    Leguizamon, L. E.
    Leguizamon, L. A.
    Leguizamon, C. E.
    TECCIENCIA, 2021, 16 (31) : 1 - 13