Mathematical model and hybrid particle swarm optimization for flexible job-shop scheduling problem
作者
Ling‐Li Zeng,Fengxing Zou,Xiaohong Xu
标识
DOI:10.1145/1543834.1543934
摘要
In this paper, A hybrid integer programming model is proposed for flexible job-shop scheduling problem(FJSP). Using crossover operator and mutation operator, the hybrid particle swarm optimization(HPSO) algorithm with simple particle swarm optimization(SPSO) algorithm and genetic algorithm(GA) is employed to solve this problem. Compared with SPSO algorithm, HPSO algorithm has a potential to reach a better optimum. The results of simulation indicate that, HPSO algorithm out performs SPSO algorithm on searching speed for global optimum and avoiding prematurity.