An improved particle swarm optimization for permutation flowshop scheduling problem with total flowtime criterion

Authors:
Xianpeng Wang;Lixin Tang
Affiliations:
Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China;Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China
Venue:
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Year:
2010

Citing 3
Cited 0

Comparison of heuristics for flowtime minimisation in permutation flowshops

Computers and Operations Research
A combinatorial particle swarm optimisation for solving permutation flowshop problems

Computers and Industrial Engineering
Handling multiple objectives with particle swarm optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the m-machine permutation flowshop scheduling problem to minimize the total flowtime, an NP-complete problem, and proposes an improved particle swarm optimization (PSO) algorithm To enhance the exploitation ability of PSO, a stochastic iterated local search is incorporated To improve the exploration ability of PSO, a population update method is applied to replace non-promising particles In addition, a solution pool that stores elite solutions found in the search history is adopted, and in the evolution process each particle learns from this solution pool besides its personal best solution and the global best solution so as to improve the learning capability of the particles Experimental results on benchmark instances show that the proposed PSO algorithm is competitive with other metaheuristics.