Paper Info
Title
An optimal deadlock avoidance policy for manufacturing systems with flexible operation sequence and flexible routing
Abstract
Addresses the deadlock avoidance problems in manufacturing systems with sequence and route flexibility. It is shown that for a large class of such systems, through one-step look ahead, an optimal deadlock avoidance policy can be obtained. For a general system the authors present a system reduction method by which the system is reduced and the reduced system has an optimal deadlock avoidance policy. Using this optimal control policy and restricting the allocation of resources with capacity one, a sub-optimal deadlock avoidance policy for the system is obtained. The proposed policies have polynomial computation complexity.
Year
DOI
Venue
2001
10.1109/ROBOT.2001.933170
ICRA
Keywords
Field
DocType
sub-optimal policy,suboptimal control,manufacturing systems,polynomial computation complexity,flexible operation sequence,system reduction method,routing and sequence flexibility,resource allocation,flexible routing,optimal deadlock avoidance policy,flexible manufacturing systems,computational complexity,complexity,one-step look ahead,directed graphs,deadlock avoidance,routing,mathematics,resource management,look ahead,optimal control,directed graph,polynomials,robots
Optimal control,Polynomial,Computer science,Deadlock,Directed graph,Look-ahead,Resource allocation,Deadlock prevention algorithms,Computational complexity theory,Distributed computing
Conference
Volume
Issue
ISSN
4
1
1050-4729
ISBN
Citations 
PageRank 
0-7803-6576-3
2
0.44
References 
Authors
9
3
Name
Order
Citations
PageRank
Keyi Xing152234.59
Feng Lin220.44
Bao-Sheng Hu31088.78