A combinatorial particle swarm optimisation for solving permutation flowshop problems

被引：74

作者：

Jarboui, Bassem ^{[2
]}

Ibrahim, Saber ^{[2
]}

Siarry, Patrick ^{[1
]}

Rebai, Abdelwaheb ^{[3
]}

机构：

[1] Univ Paris 12, LiSSi, F-94010 Creteil, France

[2] FSEGS, Sfax 3018, Tunisia

[3] ISAAS, Sfax 3018, Tunisia

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2008年 / 54卷 / 03期

关键词：

particle swarm optimization; combinatorial particle swarm optimization; permutation flowshop problem; makespan; flowtime;

D O I：

10.1016/j.cie.2007.09.006

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The m-machine permutation flowshop problem PFSP with the objectives of minimizing the makespan and the total flowtime is a common scheduling problem, which is known to be NP-complete in the strong sense, when m >= 3. This work proposes a new algorithm for solving the permutation FSP, namely combinatorial Particle Swarm Optimization. Furthermore, we incorporate in this heuristic an improvement procedure based on the simulated annealing approach. The proposed algorithm was applied to well-known benchmark problems and compared with several competing metaheuristics. (C) 2007 Elsevier Ltd. All rights reserved.

引用

页码：526 / 538

页数：13

共 38 条

[1]

Bansal S. P., 1977, AIIE Transactions, V9, P306, DOI 10.1080/05695557708975160

[2] A tabu search approach for the flow shop scheduling problem [J].