Job-shop调度问题的离散布谷鸟搜索算法求解  

Discrete Cuckoo Search Algorithm for Job-shop Scheduling Problem

作　　者：储泽楠[1] 王庆喜[1] 

机构地区：[1]安阳工学院计算机科学与信息工程学院,河南安阳455000

出　　处：《信阳师范学院学报（自然科学版）》2015年第3期442-445,共4页Journal of Xinyang Normal University(Natural Science Edition)

基　　金：国家科技重大专项项目(2012ZX04011-012);国家自然科学基金项目(U1204613);河南省重点科技攻关项目(142102310188);安阳工学院青年科研基金项目(Qjj201426)

摘　　要：在布谷鸟搜索算法的基础上,提出了一种基于升序排列的离散布谷鸟搜索算法(DCS),使用该算法求解Job-shop的经典LA问题.仿真数据显示,该算法在收敛速度、精度和稳定性方面都明显优于粒子群优化算法和萤火虫优化算法,显示出DCS算法的可行性和有效性.Based on Cuckoo search algorithm and Ranked Order Value,a kind of discrete Cuckoo search algorithm（ DCS） was proposed. The classic LA of Job-shop problem was solved by using the DCS,the results of simulation data showed that the convergence speed,accuracy and stability of the proposed algorithm were much better than that of PSO and fireflies optimization algorithm,which proved the feasibility and effectiveness of the DCS algorithm.

关 键 词：作业车间调度 布谷鸟搜索算法 升序排列规则 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]