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
来源
HUMAN CENTERED COMPUTING, HCC 2014 | 2015年 / 8944卷
关键词
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
相关论文
共 15 条
[1]   A Quantum-PSO Algorithm for No-Wait Flow shop Scheduling Problem [J].
Chang, Junlin ;
An, Fengshuan ;
Su, Pizhao .
2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5, 2010, :179-+
[2]   Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage [J].
Dong Jian-ming ;
Hu Jue-liang ;
Chen Yong .
APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B, 2013, 28 (03) :358-368
[3]  
Dou J., 2013, P IEEE INT C EV COMP, P69
[4]  
Duan JH, 2011, CHIN CONT DECIS CONF, P1514, DOI 10.1109/CCDC.2011.5968432
[5]  
Han YY, 2011, CHIN CONT DECIS CONF, P2131, DOI 10.1109/CCDC.2011.5968558
[6]   A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots [J].
Kalir, AA ;
Sarin, SC .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2001, 29 (06) :577-584
[7]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[8]  
Liiu B., 2008, CHAOS SOLITON FRACT, V35, P851
[9]  
Oguz C, 2005, J SCHEDULING, V8, P323, DOI 10.1007/s10951-005-1640
[10]  
Tasgetiren MF, 2004, LECT NOTES COMPUT SC, V3172, P382