Flexible routing and deadlock avoidance in automated manufacturing systems Conference Paper

abstract

• 1998 IEEE. 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.

name of conference

• Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146)

authors

• Lawley, Mark

published proceedings

• 2014 IEEE International Conference on Robotics and Automation (ICRA)

author list (cited authors)

• Lawley, M.

citation count

• 5

complete list of authors

• Lawley, M

publication date

• January 1998

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• n2152-4092ISSN  Journal

Digital Object Identifier (DOI)

• 10.1109/robot.1998.677037

International Standard Book Number (ISBN) 10

• 078034300X

start page

• 591-596 vol.1

end page

• 596

volume

• 1

URL

• http://dx.doi.org/10.1109/robot.1998.677037