Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (19): 49-51.DOI: 10.3778/j.issn.1002-8331.2009.19.014

• 研究、探讨 • Previous Articles     Next Articles

Study on multiprocessor scheduling problem on quantum particle swarm optimization

HUANG Tian-she,YE Chun-ming,YE Wei   

  1. School of Business,University of Shanghai for Science and Technology,Shanghai 200093,China
  • Received:2008-04-21 Revised:2008-07-21 Online:2009-07-01 Published:2009-07-01
  • Contact: HUANG Tian-she

关于多处理机调度问题的量子粒子群算法研究

黄天赦,叶春明,叶 伟   

  1. 上海理工大学 管理学院,上海 200093
  • 通讯作者: 黄天赦

Abstract: The paper gives an optimization mathematical model of multiprocessor scheduling problem.A novel hybrid Particle Swarm Optimization(PSO) algorithm called Quantum Particle Swarm Optimization(QPSO) for this problem is proposed.The algorithm not only has the fast optimum search ability,but also improves the accuracy in the later evolution period.The experimental results of QPSO on multiprocessor scheduling problem show the efficiency of the new algorithm.

摘要: 对多处理机调度问题建立数学模型,提出了将量子计算和粒子群算法相结合的方法来解决这类调度问题,该方法不仅寻优速度快,而且提高了进化后期算法的收敛精度。通过对比测试,体现了量子粒子群算法的有效性。