检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:许梦楠 陈兵[1] XU Meng-nan;CHEN Bing(Colleage of Computer and Science Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China)
机构地区:[1]南京航空航天大学计算机科学与技术学院,南京211106
出 处:《小型微型计算机系统》2021年第9期1826-1829,共4页Journal of Chinese Computer Systems
基 金:国家自然科学基金面上项目(2019YFB2102000)资助。
摘 要:以高效率调度车间作业程序为目标,提出基于改进布谷鸟搜索算法的车间作业调度优化算法.首先构建车间作业调度优化数学模型,设置约束条件,根据约束条件,将加工耗时最短的目标设成车间作业调度优化目标,设置车间作业调度目标函数,然后对布谷鸟搜索算法的调节步长等进行改进,并采用改进布谷鸟搜索算法获取车间作业调度方案最优解,最后进行了车间作业调度优化的仿真实验.结果表明:改进布谷鸟搜索算法的车间加工效率加快,车间作业加工耗时明显减少,提高了找到最优车间作业调度方案的成功率.Aiming at the high efficiency of job shop scheduling,a job shop scheduling optimization algorithm based on the improved cuckoo search algorithm is proposed.Firstly Jthe mathematical model of job shop scheduling optimization is constructed,and the constraints are set.According to the constraints Jthe objective of the shortest processing time is set as the objective of job shop scheduling optimization,and the objective function of job shop scheduling is established.Then Jthe adjustment step length of the cuckoo search algorithm is improved,and the optimal solution of job shop scheduling scheme is obtained by the improved cuckoo search algorithm The simulation results show that the processing efficiency of the improved cuckoo search algorithm is faster,the total value of the mean processing time and the maximum processing time of the optimization scheme is reduced,and the total value of the success rate of the optimization is increased.
关 键 词:布谷鸟搜索算法 车间作业 调度优化 调节步长 双向检索
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7