An improved particle swarm optimization algorithm for flowshop scheduling problem

	An improved particle swarm optimization algorithm for flowshop scheduling problem
其他题名	论文其他题名
	Zhang C. S.; Sun J.; Zhu X. G.; Yang Q. Y.
	2008
发表期刊	Information Processing Letters
ISSN	0020-0190
卷号	108 期号:4 页码:204-209
摘要	The flowshop scheduling problem has been widely studied and many techniques have been applied to it, but few algorithms based on particle swarm optimization (PSO) have been proposed to solve it 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 stagnate, 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 the proposed IPSO algorithm is more effective and better than the other compared algorithms. It can be used to solve large scale flow shop scheduling problem effectively. Crown Copyright (C) 2008 Published by Elsevier B.V. All rights reserved.
收录类别	SCI ; EI
语种	英语
文献类型	期刊论文
条目标识符	http://ir.ciomp.ac.cn/handle/181722/26407
专题	中科院长春光机所知识产出
推荐引用方式 GB/T 7714	Zhang C. S.,Sun J.,Zhu X. G.,et al. An improved particle swarm optimization algorithm for flowshop scheduling problem[J]. Information Processing Letters,2008,108(4):204-209.
APA	Zhang C. S.,Sun J.,Zhu X. G.,&Yang Q. Y..(2008).An improved particle swarm optimization algorithm for flowshop scheduling problem.Information Processing Letters,108(4),204-209.
MLA	Zhang C. S.,et al."An improved particle swarm optimization algorithm for flowshop scheduling problem".Information Processing Letters 108.4(2008):204-209.

条目包含的文件		下载所有文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
Zhang-2008-An improv（182KB）			开放获取	--	浏览下载