计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (26): 227-229.DOI: 10.3778/j.issn.1002-8331.2008.26.069

• 工程与应用 • 上一篇    下一篇

求解多工艺路线车间调度问题的禁忌-遗传算法

宋存利1,时维国2   

  1. 1.大连交通大学 软件学院,辽宁 大连 116028
    2.大连交通大学,辽宁 大连 116028
  • 收稿日期:2007-11-01 修回日期:2007-12-27 出版日期:2008-09-11 发布日期:2008-09-11
  • 通讯作者: 宋存利

TS-GA for solving multi-craft Job-Shop Scheduling

SONG Cun-li1,SHI Wei-guo2   

  1. 1.Software Institute,Dalian Jiaotong University,Dalian,Liaoning 116028,China
    2.Dalian Jiaotong University,Dalian,Liaoning 116028,China
  • Received:2007-11-01 Revised:2007-12-27 Online:2008-09-11 Published:2008-09-11
  • Contact: SONG Cun-li

摘要: 车间调度问题是一个NP难题,而多工艺路线的车间调度问题更具有实际的研究意义。从生产实际出发,在分析了多工艺路线的车间调度问题一般特点的基础了,提出了一种禁忌-遗传的嵌套算法,该算法重点讨论了禁忌算法的设计思想及遗传算法中遗传算子的设计。仿真实例说明了算法的有效可行。

Abstract: Job-Shop Scheduling(JSS) is a NP problem,but the research for Job-Shop Scheduling with multi-craft is more practical.In this paper,the character of the Job-Shop Scheduling with multi-craft is analyzed,a nested algorithm TS-GA is presented,the design idea of TS and the selection,crossover,mutation operator of GA is discussed.The experiment proves the effective and feasible of the TS-GA.