机构地区: 南京航空航天大学机电学院
出 处: 《南京航空航天大学学报》 2004年第3期317-321,共5页
摘 要: 遗传算法被广泛应用于求解作业车间调度问题。然而 ,要用遗传算法有效求解 JSSP问题 ,有一些问题必须首先解决 ,死锁问题就是其中之一。本文以死锁问题为中心 ,从死锁处理角度分析三种用于克服使用 GA求解JSSP时出现死锁的有用方法 。 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.
领 域: [自动化与计算机技术] [自动化与计算机技术]