文献类型：期刊文献

英文题名：A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan

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

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

年份：2006

卷号：183

期号：2

起止页码：1008

外文期刊名：APPLIED MATHEMATICS AND COMPUTATION

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

语种：英文

外文关键词：job-shop scheduling; particle swarm optimization; SPSO algorithm

摘要：The job-shop scheduling problem (JSSP) is a branch of production scheduling, and it is well known that this problem is NP-hard. Many different approaches have been applied to JSSP and a rich harvest has been obtained. However, some JSSP, even with moderate size, cannot be solved to guarantee optimality. The standard particle optimization algorithm generally is used to solve continuous optimization problems, and is used rarely to solve discrete problems such as JSSP. This paper presents a similar PSO algorithm to solve JSSP. At the same time, some new valid algorithm operators are proposed in this paper, and through simulation we find out the effectiveness of them. Three representative (Taillard) instances were made by computational experiments, through comparing the SPSO algorithm with standard GA, and we obtained that the SPSOA is more clearly efficacious than standard GA for JSSP to minimize makespan. (c) 2006 Elsevier Inc. All rights reserved.