By Topic

Deadlock avoidance policies for automated manufacturing cells

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

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

The problem of deadlock resolution arising in manufacturing environments organized according to the typical process-layout has only recently been undertaken by the scientific community. Furthermore, deadlock avoidance methodologies, which seem to be the most appropriate deadlock-handling strategies in this particular context, unfortunately, in the general case, suffer from increased computational complexity results in heuristic solutions and/or reduced performance. This paper proposes an analytical framework for designing scalable and yet provably correct deadlock avoidance policies for a subclass of resource allocation systems (RAS), which is appropriate for the study of the deadlock problem in the context of the automated manufacturing cell (AMC). The framework is used to prove the correctness of the resource upstream neighborhood (RUN) policy, developed in the authors' research program

Published in:

American Control Conference, Proceedings of the 1995  (Volume:5 )

Date of Conference:

21-23 Jun 1995