计算机工程 ›› 2010, Vol. 36 ›› Issue (5): 185-187.doi: 10.3969/j.issn.1000-3428.2010.05.067

• 人工智能及识别技术 • 上一篇    下一篇

一种车间调度死锁实时解决算法

赵 军1,许玉龙1,孙晓静2   

  1. (1. 重庆邮电大学计算机科学与技术研究所,重庆 400065;2. 西安交通大学系统工程研究所,西安 700049)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-05 发布日期:2010-03-05

Real-time Solving Deadlock Algorithm for Job-shop Schedule

ZHAO Jun1, XU Yu-long1, SUN Xiao-jing2   

  1. (1. Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065; 2. Institute of Systems Engineering, Xi’an Jiaotong University, Xi’an 700049)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-05 Published:2010-03-05

摘要: 对比2种不同的编码形式及算法,提出一种实时发现和死锁解决算法,该算法不抛弃任何染色体,仅调整死锁染色体内基因的调度顺序,从而实现所有染色体的调度,并快速找出最优解。仿真实验结果表明,该算法是有效的。

关键词: 车间调度问题, 死锁, 遗传算法, 染色体

Abstract: Two different methods for coding is compared. On this basis, a novel algorithm with real-time discovery and solving the deadlock is presented, which does not abandon any of chromosomes, just adjusts the genes dispatching order in deadlock chromosome. It schedules all chromosomes, and finds out the optimal solution quickly. Simulation results show this algorithm is effective.

Key words: Job-shop Schedule Problem(JSP), deadlock, Genetic Algorithm(GA), chromosomes

中图分类号: