DEADLOCK-FREE SCHEDULING METHOD BASED ON PETRI NET AND GA

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

作者机构：School of Automation Shanghai Jiaotong University Shanghai 200030 China 

出 版 物：《Chinese Journal of Mechanical Engineering》 (中国机械工程学报（英文版）)

年 卷 期：2003年第16卷第4期

页      面：371-375页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

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

主　　题：GA Petri net Deadlock-free scheduling 

摘      要：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.