Please use this identifier to cite or link to this item:

Title: New particle swarm optimization algorithm for makespan minimization in permutation flowshop sequencing
Authors: Chen, Tingyu;Chen, Chuenlung
Contributors: 資訊管理學系
Keywords: Makespan;Makespan minimization;New particle swarm optimization;Permutation flow shops;Permutation flowshop scheduling problems;PSO algorithms;Random keys;Scheduling algorithms;Particle swarm optimization (PSO)
Date: 2009-12
Issue Date: 2015-06-01 17:24:42 (UTC+8)
Abstract: Particle Swarm Optimization (PSO) is a new type of heuristic inspired by the flocking behavior of birds. This paper presents a Particle Swarm Optimization (PSO) to solve the permutation flowshop scheduling problem (PFSP) objectives, to minimize the makespan. To this end, we have proposed the use of discrete PSO algorithm for the position of the smallest value (SPV) to use a random key representation of Bean [Baena Bean, Genetic algorithms and random keys sequencing and optimization, Orsa calculated Journal 6 (2) (1994) 154-160]. In the proposed algorithm, the particle and the velocity re-defined and effective way to develop a series of new particles. In addition, we analyzed the characteristics of the elite jobs in the proposed algorithm. The results showed that the idea really follows the approach of PSO. © 2009 IEEE.
Relation: 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009,868-871
Data Type: conference
DOI 連結:
Appears in Collections:[資訊管理學系] 會議論文

Files in This Item:

There are no files associated with this item.

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing