Kind of deadlock-free scheduling method  

作　　者：徐刚 吴智铭 

机构地区：[1]1416Postbox,HaoranBuilding,ShanghaiJiaotongUniversity,Shanghai200030,P.R.China [2]InstituteofAutomation,ShanghaiJiaotongUniversity,Shanghai200030,P.R.China

出　　处：《Journal of Systems Engineering and Electronics》2004年第3期399-406,共8页系统工程与电子技术（英文版）

基　　金：This project was supported by the National Natural Science Foundation of China (60074011, 70071017).

摘　　要：Deadlock must be avoided in a manufacturing system. In this paper, an efficient algorithm for finding an optimal deadlock-free schedules in a manufacturing system with very limited buffer is presented. This algorithm is based on the effective genetic algorithm (GA) search method, and a formal Petri net structure is introduced to detect the token player assuring deadlock-free. In order to make the scheduling strategy generated by GA meet the required constraint of deadlock-free, some results of the structure analysis of Petri net are involved as a criterion to select deadlock-free schedule from the population generated by GA. The effectiveness and efficiency of the proposed approach is illustrated by using an example.Deadlock must be avoided in a manufacturing system. In this paper, an efficient algorithm for finding an optimal deadlock-free schedules in a manufacturing system with very limited buffer is presented. This algorithm is based on the effective genetic algorithm (GA) search method, and a formal Petri net structure is introduced to detect the token player assuring deadlock-free. In order to make the scheduling strategy generated by GA meet the required constraint of deadlock-free, some results of the structure analysis of Petri net are involved as a criterion to select deadlock-free schedule from the population generated by GA. The effectiveness and efficiency of the proposed approach is illustrated by using an example.

关 键 词：GA Petri net DEADLOCK scheduling. 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]