An Improved Particle Swarm Optimization for Permutation Flowshop Scheduling Problem with Total Flowtime Criterion
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.
KeywordsPermutation flowshop particle swarm optimization
Unable to display preview. Download preview PDF.
- 4.Bansal, S.P.: Minimizing the sum of completion times of n jobs over m machines in a flowshop – a branch and bound approach. AIIE Transactions 9, 306–311 (1977)Google Scholar
- 6.Gupta, J.N.D.: Heuristic algorithms for multistage flowshop scheduling problem. AIIE Transactions 4, 11–18 (1972)Google Scholar
- 12.Yamada, T., Reeves, C.R.: Solving the Csum permutation flowshop scheduling problem by genetic local search. In: Proceedings of IEEE international conference on evolutionary computation, pp. 230–234 (1998)Google Scholar
- 17.Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Network, pp. 1942–1948 (1995)Google Scholar
- 18.Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, pp. 39–43 (1995)Google Scholar
- 21.Congram, R.K.: Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation. PhD Thesis, University of Southampton (2000)Google Scholar