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 条
  • [1] Hybrid particle swarm optimization for permutation flow shop scheduling
    Liu, Zhixiong
    Wang, Shaomei
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 3245 - +
  • [2] Hybrid Mean Particle Swarm Optimization Algorithm for Permutation Flow Shop Scheduling Problem
    Zhou, Yongquan
    Huang, Zhengxin
    Du, Yanlian
    Gong, Qiaoqiao
    FRONTIERS OF MANUFACTURING AND DESIGN SCIENCE, PTS 1-4, 2011, 44-47 : 270 - 274
  • [3] Permutation Flow Shop Scheduling: Fuzzy Particle Swarm Optimization Approach
    Ling, Sai Ho
    Jiang, Frank
    Nguyen, Hung T.
    Chan, Kit Yan
    IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ 2011), 2011, : 572 - 578
  • [4] A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem
    Chen, Chun-Lung
    Huang, Shin-Ying
    Tzeng, Yeu-Ruey
    Chen, Chuen-Lung
    SOFT COMPUTING, 2014, 18 (11) : 2271 - 2282
  • [5] A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem
    Chun-Lung Chen
    Shin-Ying Huang
    Yeu-Ruey Tzeng
    Chuen-Lung Chen
    Soft Computing, 2014, 18 : 2271 - 2282
  • [6] A hybrid particle swarm optimization for job shop scheduling problem
    Sha, D. Y.
    Hsu, Cheng-Yu
    COMPUTERS & INDUSTRIAL ENGINEERING, 2006, 51 (04) : 791 - 808
  • [7] Solving flow-shop scheduling problem by hybrid particle swarm optimization algorithm
    Gao Shang
    Yang Jing-yu
    Proceedings of 2006 Chinese Control and Decision Conference, 2006, : 1006 - +
  • [8] Effective hybrid particle swarm optimization algorithm for blocking flow shop scheduling problem
    Zhang, Qi-Liang
    Chen, Yong-Sheng
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2012, 18 (12): : 2689 - 2695
  • [9] No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm
    Pan, Quan-Ke
    Wang, Ling
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 39 (7-8): : 796 - 807
  • [10] No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm
    Quan-Ke Pan
    Ling Wang
    The International Journal of Advanced Manufacturing Technology, 2008, 39 : 796 - 807