By Topic

A kind of deadlock-free scheduling method based on Petri net

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xu Gang ; Inst. of Autom., Shanghai Jiao Tong Univ., China ; Zhiming Wu

In this paper an efficient algorithm for finding an optimal deadlock-free schedules in a flexible manufacturing system (FMS) modeled by a kind of Petri net, systems of simple sequential processes with shared resources (S4R) 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.

Published in:

High Assurance Systems Engineering, 2002. Proceedings. 7th IEEE International Symposium on

Date of Conference: