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
摘要: 对比2种不同的编码形式及算法,提出一种实时发现和死锁解决算法,该算法不抛弃任何染色体,仅调整死锁染色体内基因的调度顺序,从而实现所有染色体的调度,并快速找出最优解。仿真实验结果表明,该算法是有效的。
关键词:
车间调度问题,
死锁,
遗传算法,
染色体
CLC Number:
ZHAO Jun; XU Yu-long; SUN Xiao-jing. Real-time Solving Deadlock Algorithm for Job-shop Schedule[J]. Computer Engineering, 2010, 36(5): 185-187.
赵 军;许玉龙;孙晓静. 一种车间调度死锁实时解决算法[J]. 计算机工程, 2010, 36(5): 185-187.