| 用遗传算法求解JSSP时的死锁对策研究 |
| |
| 引用本文： | 李进,楼佩煌.用遗传算法求解JSSP时的死锁对策研究[J].南京航空航天大学学报,2004,36(3):317-321. |
| |
| 作者姓名： | 李进 楼佩煌 |
| |
| 作者单位： | 南京航空航天大学机电学院,南京,210016 |
| |
| 摘 要： | 遗传算法被广泛应用于求解作业车间调度问题。然而，要用遗传算法有效求解JSSP问题，有一些问题必须首先解决，死锁问题就是其中之一。本文以死锁问题为中心，从死锁处理角度分析三种用于克服使用GA求解JSSP时出现死锁的有用方法，并给出了相应的实验统计结果和对比分析结论。
|
| 关 键 词： | 死锁 车间调度 遗传算法 |
| 文章编号： | 1005-2615(2004)03-0317-05 |
| 修稿时间： | 2003年5月19日 |
Study on Strategies of Overcoming Deadlocks in GA-Based Solution for JSSP |
| |
| LI Jin,LOU Pei-huang.Study on Strategies of Overcoming Deadlocks in GA-Based Solution for JSSP[J].Journal of Nanjing University of Aeronautics & Astronautics,2004,36(3):317-321. |
| |
| Authors: | LI Jin LOU Pei-huang |
| |
| Abstract: | Genetic algorithm is widely applied to the job shop scheduling problem (JSSP) and is proved to be a better solution for JSSP compared with most conventional solutions. However, several problems must be solved by achieving a performance-superior GA-based solution for JSSP, of which deadlock problem is a very tough obstacle. This paper analyzes three methods for overcoming the deadlock problem. Finally, statistical results of the GA-based solutions for JSSP and conclusions are given. |
| |
| Keywords: | deadlock job shop scheduling genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
