By Topic

Deadlock avoidance policies for resource allocation systems with applications to FMS

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

3 Author(s)
Ferreira, P.M. ; Dept. of Mech. & Ind. Eng., Illinois Univ., Urbana, IL, USA ; Lawley, M.A. ; Reveliotis, S.A.

The problem of deadlock avoidance for a class of resource allocation systems (RAS) called the single-unit RAS (SU-RAS) is discussed with particular application to buffer space allocation in a flexible manufacturing system. For a class of SU-RAS, it is shown that the problem of obtaining the maximally permissive deadlock avoidance policy is of polynomial complexity. Sub-optimal policies (which are not maximally permissive) for SU-RAS are also discussed

Published in:

Emerging Technologies and Factory Automation, 1996. EFTA '96. Proceedings., 1996 IEEE Conference on  (Volume:1 )

Date of Conference:

18-21 Nov 1996