System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Flexible routing and deadlock avoidance in automated manufacturing systems

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

1 Author(s)
Lawley, M. ; Sch. of Ind. Eng., Purdue Univ., West Lafayette, IN, USA

Deadlock avoidance policies guarantee deadlock free buffer space allocation to concurrent competing parts in flexible manufacturing systems. Typically, these policies require enumeration of routes that parts follow. In systems with flexible routing, where parts can choose from a set of machines at each processing step, route enumeration can be of exponential complexity. Setup and execution of deadlock avoidance constraints are rendered computationally intractable. The objective of this work is to develop a control model that allows for several processing alternatives at each step while maintaining polynomial bounds on deadlock-free operation

Published in:

Robotics and Automation, 1998. Proceedings. 1998 IEEE International Conference on  (Volume:1 )

Date of Conference:

16-20 May 1998