loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
7th IEEE International Symposium on High Assurance Systems Engineering (HASE'02)
A Kind of Deadlock-free Scheduling Method Based on Petri Net
Tokyo, Japan
October 23-October 25
ISBN: 0-7695-1769-2
Xu Gang, ShangHai Jiaotong University
Zhiming Wu, ShangHai Jiaotong University
In this paper an efficient algorithm for finding an optimal deadlock-free schedules in an Flexible Manufacturing System (FMS) modeled by a kind of Petri net, Systems of Simple Sequential Processes with Shared Resources (S4 R) nets, is presented. This algorithm is based on the effective Genetic Algorithm (GA) search method, and the structural elements analysis of Petri net. In order to find the optimum and deadlock-free scheduling strategy from the population generated by GA , Petri net structural analysis procedure is involved as a criterion to select among population and make the job scheduling deadlock-free. The effectiveness and efficiency of the proposed approach is illustrated using an example at the end of the paper.
Citation:
Xu Gang, Zhiming Wu, "A Kind of Deadlock-free Scheduling Method Based on Petri Net," hase, pp.195, 7th IEEE International Symposium on High Assurance Systems Engineering (HASE'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.