By Topic

Deadlock avoidance in manufacturing systems with a multiple resource request model

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
$33 $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

3 Author(s)
R. P. Judd ; Sch. of Electr. Eng. & Comput. Sci., Ohio Univ., Athens, OH, USA ; W. Zhang ; R. Lipset

A deadlock avoidance method for flexible manufacturing systems with both free choices and multiple resource requests allowed in part routing is presented. Based on a digraph model of the system, the method classifies whether moving a part to its next step is safe, unsafe, or undetermined. An undetermined part movement is further analyzed using a very efficient system simulation, which attempts to empty the system virtually to determine whether the move is safe. This classification algorithm is shown to be polynomial in complexity. To avoid deadlocks, only safe part movements should be allowed to proceed. An example is provided to illustrate how the method can be applied.

Published in:

Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301)  (Volume:6 )

Date of Conference:

8-10 May 2002