DEADLOCK-FREE SCHEDULING METHOD BASED ON PETRI NET AND GA  

作　　者：Xu Gang Wu ZhimingSchool of Automation,Shanghai Jiaotong University,Shanghai 200030, China 

出　　处：《Chinese Journal of Mechanical Engineering》2003年第4期371-375,共5页中国机械工程学报（英文版）

基　　金：National Natural Science Foundation of China (No.60074011,70071017)

摘　　要：An efficient algorithm for finding an optimal deadlock-free schedule in amanufacturing system with very limited buffer is presented. This algorithm is based on the effectivegenetic algorithm (GA) search method, and a formal Petri net structure is introduced to detect thetoken player assuring deadlock-free. In order to make the scheduling strategy generated by GA meetthe required constraint of deadlock-free, Petri net is involved to make the implementation of thejob scheduling in an FMS deadlock-free. The effectiveness and efficiency of the proposed approach isillustrated by using an example.An efficient algorithm for finding an optimal deadlock-free schedule in amanufacturing system with very limited buffer is presented. This algorithm is based on the effectivegenetic algorithm (GA) search method, and a formal Petri net structure is introduced to detect thetoken player assuring deadlock-free. In order to make the scheduling strategy generated by GA meetthe required constraint of deadlock-free, Petri net is involved to make the implementation of thejob scheduling in an FMS deadlock-free. The effectiveness and efficiency of the proposed approach isillustrated by using an example.

关 键 词：GA Petri net Deadlock-free scheduling 

分 类 号：TB11[理学—数学]