An improved particle swarm optimization algorithm for flowshop scheduling problem
(0) The flowshop scheduling problem has been widely studied in the literature and many techniques have been applied to it,but few algorithms have been proposed to solve it using particle swarm optimization algorithm(PSO) based algorithm.In this paper,an improved PSO algorithm (IPSO)based on the alldifferent constraint is proposed to solve the flow shop scheduling problem with the objective of minimizing makespan.It combines the particle swarm optimization algorithm with genetic operators together effectively.When a particle is going to stagnates,the mutation operator is used to search its neighborhood.The proposed algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms.The results show that both the solution quality and the convergent speed of the IPSO algorithm precede the other two recently proposed algorithms.It can be used to solve large scale flow shop scheduling problem effectively.
flow shop scheduling problem particle swarm optimization makespan
Bo Li Changsheng Zhang Ge Bai Erliang Zhang
The computing center of Changchun Institute of Technology 2699 Qianjin Street,Changchun,130012 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education 2699 Qia Aviation university of air force 2699 Qianjin Street,Changchun,130012 China
国际会议
2008 IEEE International Conference on Onformation and Automation(IEEE 信息与自动化国际会议)
张家界
英文
1226-1231
2008-06-20（万方平台首次上网日期，不代表论文的发表时间）