Home|News|Literature|Journal|Instruction|Forum|Member|Introduction

Chinese  Old version

By    In    Search 

  HomeContents of Chinese Journal of Mechanical Engineering (English Edition),2003 No.4DEADLOCK-FREE SCHEDULING METHOD BASED ON PETRI NET AND GA

Xu Gang

 

Wu Zhiming

College of Mechanical Engineering and Applied Electronics,
Beijing University of Technology,
Beijing 100022, China

 

 

DEADLOCK-FREE SCHEDULING METHOD BASED ON PETRI NET

AND GA*


Abstract: An efficient algorithm for finding an optimal deadlock-free schedule 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, Petri net is involved to make the implementation of the job scheduling in an FMS deadlock-free. The effectiveness and efficiency of the proposed approach is illustrated by using an example.

Key words: GA  Petri net  Deadlock-free scheduling

 


* This project is supported by National Natural Science Foundation of China (No.60074011, 70071017). Received October 30, 2002; received in revised form May 8, 2003; accepted May 19, 2003

 

Open or Download Full Text of this Paper (PDF File)

About us-Contact us-Site map-Advertisement service-Cooperation-Legal statement

Address: 22 Baiwanzhuang Dajie, Beijing 100037 China    Tel: 8610-88379907    Fax: 8610-68994557

E-mail: cjme@mail.machineinfo.gov.cn  http: //www.cjmenet.com
©2006 Editorial Office of CJME. All Right Reserved