The Community for Technology Leaders
Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE (2008)
Dec. 19, 2008 to Dec. 20, 2008
ISBN: 978-0-7695-3490-9
pp: 332-336
Flexible job shop scheduling problem (FJSP) is a research hotspot of job shop scheduling problems (JSPs). JSP has been proved to be NP-hard, yet the computational complexity of FJSP is much higher, which disables exact solution methods and makes heuristic approaches more qualified. In this paper, a kind of FJSP is analyzed and formulated, which considers storing and maintaining costs of operations finished ahead of schedule, compensation fees of delayed jobs, and the requirement of evenly allocating workloads among machines. A particle swarm optimization algorithm (PSO) based on a swarm grouping mechanism is proposed for this FJSP problem. The algorithm partitions the swarm into many groups, and each group flies toward its own global best particle. Adopting the swarm grouping mechanism, the algorithm avoids of being premature. Feasibility and efficiency of the algorithm are verified through numerical experiments by comparing it with Genetic algorithm (GA) and standard PSO.

S. Tang, M. Feng, G. Li, H. Jun and X. Yi, "A Grouping Particle Swarm Optimization Algorithm for Flexible Job Shop Scheduling Problem," 2008 Pacific-Asia Workshop on Computational Intelligence and Industrial Application. PACIIA 2008(PACIIA), Wuhan, 2008, pp. 332-336.
93 ms
(Ver 3.3 (11022016))