有工件交货期限制的车间作业调度方法研究  

New Research Method of JSS with Work Piece Delivery Time Limitation

作　　者：纪怀猛[1] 罗可[1] 

机构地区：[1]长沙理工大学计算机与通讯工程学院,长沙410076

出　　处：《计算机工程与应用》2006年第36期187-190,232,共5页Computer Engineering and Applications

基　　金：国家自然科学基金资助项目;湖南省自然科学基金资助项目;湖南省教育厅科研基金资助项目

摘　　要：在车间作业调度中,如何合理安排工件在机器上的加工顺序是企业生产过程研究的关键问题。针对传统优化方法只是对总体加工时间最少进行研究及遗传算法中过早收敛的缺点,通过在加入总体加工时间调节因子,提出了在保证总体在加工时间最短或相对最短的前提下保证某一工件交货期的免疫遗传车间作业调度方法。最后对著名的FT10×10标准问题进行了仿真实验,首先通过修改调节因子进行了结果比较,然后同其它算法的结果进行了比较。仿真结果说明了该方法的可行性和优越性。In the Job-Shop Scheduling problem,how to arrange the work piece on machine processing order reasonably is the essential problem of enterprise production process research.In view of the deficiencies of traditional optimization method and the shortcoming of too early convergence of genetic algofithm,a new method based on immune genetic algorithm of JSS is proposed.By adding the overall made-process time adjustment factor to guarantee that the overall process time is the shortest or the relative shortest can guarantee some work piece delivery time limitation.By simulations of the famous FT10×10 benchmark problem and comparisons with not only the method by adjusting adjustment factors, but also other algorithms,the proposed method proves to be efficient in solving JSS problem.

关 键 词：车间作业调度 自适应 免疫遗传算法 FT10×10 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]