摘要
针对无等待Job Shop问题,采用量子粒子群优化算法对其进行了求解。该算法采用位置矢量的编码方式,全左移验证方式计算适应值。最后通过MATLAB对实例问题的仿真测试,量子粒子群优化算法不仅收敛速度快,而且还具有较好的求解质量。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第26期200-202,248,共4页
Computer Engineering and Applications
