Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (26): 200-202.DOI: 10.3778/j.issn.1002-8331.2010.26.062

• 工程与应用 • Previous Articles     Next Articles

Solve no wait job shop scheduling problem based on quantum particle swarm algorithm

SHI Ruo1,2,ZONG Li-yong2   

  1. 1.School of Finance,College of Finance and Economy of Guizhou,Guiyang 550004,China
    2.College of Management,University of Shanghai for Science and Technology,Shanghai 200093,China
  • Received:2009-11-05 Revised:2010-03-29 Online:2010-09-11 Published:2010-09-11
  • Contact: SHI Ruo

求解无等待Job Shop调度的量子粒子群算法

施 若1,2,宗利永2   

  1. 1.贵州财经学院 金融学院,贵阳 550004
    2.上海理工大学 管理学院,上海 200093
  • 通讯作者: 施 若


Coping with no wait job shop scheduling problem,the method that quantum particle swarm algorithm is proposed to be applied to no wait job shop scheduling problem,this algorithm uses location of the vector encoding scheme and the method of left shift timetabling to compute fitness.Then this algorithm is applied to benchmarks problems and tested with MATLAB simulation,the result shows that this algorithm has better answers and more rapid convergence.

Key words: no-wait job shop scheduling problem, quantum particle swarm optimization, particle swarm optimization

摘要: 针对无等待Job Shop问题,采用量子粒子群优化算法对其进行了求解。该算法采用位置矢量的编码方式,全左移验证方式计算适应值。最后通过MATLAB对实例问题的仿真测试,量子粒子群优化算法不仅收敛速度快,而且还具有较好的求解质量。

关键词: 无等待Job Shop问题, 量子粒子群优化算法, 粒子群优化算法

CLC Number: