首页 | 本学科首页   官方微博 | 高级检索  
     

解决并行多机提前/拖后调度问题的混合遗传算法方法
引用本文:刘民,吴澄.解决并行多机提前/拖后调度问题的混合遗传算法方法[J].自动化学报,2000,26(2):258-262.
作者姓名:刘民  吴澄
作者单位:1.清华大学自动化系,北京
基金项目:国家八六三高技术计划基金(863-511-9600-008)和教育部博士点基金(9500322)资助项目.
摘    要:研究了带有公共交货期的并行多机提前/拖后调度问题.提出了一种混合遗传算法 方法,以便于确定公共交货期和每台机器上加工的任务代号及其加工顺序,即找到一个最优 公共交货期和最优调度,使加工完所有任务后交货期安排的成本、提前交货成本和拖后交货 成本的总和最小.数值计算结果表明了该混合遗传算法优于启发式算法,并能适用于较大规 模并行多机提前/拖后调度问题.算法计算量小,鲁棒性强.

关 键 词:并行多机    遗传算法    提前/拖后    交货期安排    调度问题
收稿时间:1998-4-28
修稿时间:1998-04-28

HYBRID GENETIC ALGORITHM METHOD FOR IDENTICAL PARALLEL MACHINE EARLINESS/TARDINESS SCHEDULING PROBLEM
LIU Min,WU Cheng.HYBRID GENETIC ALGORITHM METHOD FOR IDENTICAL PARALLEL MACHINE EARLINESS/TARDINESS SCHEDULING PROBLEM[J].Acta Automatica Sinica,2000,26(2):258-262.
Authors:LIU Min  WU Cheng
Affiliation:1.Department of Automation,Tsinghua University,Beijing
Abstract:Identical parallel machine earliness/tardiness scheduling problem with common due-date is studied. A kind of hybrid genetic algorithm is presented to determine the common due date,job code.and processing orders of every processed job on each machine,that is,find an optimal common due-date and optimal scheduling policy for minimizing the total cost of assignment of due-date,early delivery and tardy delivery. Numerical computations show that the hybrid genetic algorithm has advantage over heuristic procedure ,and is fit for larger scale identical parallel machine earliness/tardiness scheduling problem. The algorithm proposed has low computational complexity and strong robustness.
Keywords:Identical parallel machine  genetic algorithm  earliness/tardiness  duedate assignment  scheduling problem  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号