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 条
  • [21] An effective hybrid particle swarm optimization for flexible job shop scheduling problem
    Zhang, Guohui, 1604, Bentham Science Publishers B.V., P.O. Box 294, Bussum, 1400 AG, Netherlands (06):
  • [22] A hybrid particle swarm optimization approach for the job-shop scheduling problem
    Xia, Wei-Jun
    Wu, Zhi-Ming
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 29 (3-4): : 360 - 366
  • [23] An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem
    Liao, Ching-Jong
    Tjandradjaja, Evi
    Chung, Tsui-Ping
    APPLIED SOFT COMPUTING, 2012, 12 (06) : 1755 - 1764
  • [24] A new Hybrid Particle Swarm Optimization for Solving Flow Shop Scheduling Problem with Fuzzy Due Date
    Tang, Haibo
    Ye, Chunming
    Jiang, Liangfu
    MANUFACTURING PROCESS TECHNOLOGY, PTS 1-5, 2011, 189-193 : 2746 - 2753
  • [25] A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem
    Hajinejad, D.
    Salmasi, N.
    Mokhtari, R.
    SCIENTIA IRANICA, 2011, 18 (03) : 759 - 764
  • [26] ADAPTIVE FUZZY PARTICLE SWARM OPTIMIZATION FOR FLOW-SHOP SCHEDULING PROBLEM
    Galzina, Vjekoslav
    Lujic, Roberto
    Saric, Tomislav
    TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2012, 19 (01): : 151 - 157
  • [27] A circular discrete particle swarm optimization algorithm for flow shop scheduling problem
    Liang, Shubin
    Ning, Jiaxu
    Wang, Xiaodong
    Xue, Zhanao
    2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES: ITESS 2008, VOL 4, 2008, : 1151 - 1156
  • [28] The circular discrete particle swarm optimization algorithm for flow shop scheduling problem
    Zhang, Jindong
    Zhang, Changsheng
    Liang, Shubin
    EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (08) : 5827 - 5834
  • [29] Adaptive fuzzy particle swarm optimization for flow-shop scheduling problem
    Galzina, Vjekoslav
    Lujić, Roberto
    Šarić, Tomislav
    Tehnicki Vjesnik, 2012, 19 (01): : 151 - 157
  • [30] 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