文献类型：期刊文献

英文题名：A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan

作者：Lian, Zhigang[1]; Gu, Xingsheng[1]; Jiao, Bin[1,2]

机构：[1]E China Univ Sci & Technol, Res Inst Automat, Shanghai 200237, Peoples R China;[2]Shanghai DianJi Univ, Elect Engn Dept, Shanghai 200240, Peoples R China

年份：2006

卷号：175

期号：1

起止页码：773

外文期刊名：APPLIED MATHEMATICS AND COMPUTATION

收录：;EI(收录号：2006129766684);WOS:【SCI-EXPANDED(收录号:WOS:000241776800059)】；

语种：英文

外文关键词：flow-shop scheduling; genetic algorithm; particle swarm optimization; similar particle swarm optimization algorithm (SPSOA); crossover operators

摘要：The flow-shop scheduling problem (FSSP) is a branch of production scheduling, which is among the hardest combinatorial optimization problems. It is well known that this problem with current algorithms even moderately sized problems cannot be solved to guaranteed optimality. Many different approaches have been applied for permutation flowshop scheduling to minimize makespan, but these methods are not satisfying. Particle swarm optimization (PSO) has been developing rapidly and has been applied widely since it was introduced, as it is easily understood and realized. This paper through the improvement of the option modes of gBest and pBest of PSO algorithm, a similar particle swarm optimization algorithm (SPSOA) applied for permutation flowshop scheduling to minimize makespan is firstly presented. The comparisons are made with SPSOAs and the standard GAs, in which we obtained that the SPSOAs are more clearly efficacious than standard GAs for FSSP to minimize makespan. Computational experiments show the efficiency of the proposed (SPSOA) solving approaches. (c) 2005 Elsevier Inc. All rights reserved.