DocumentCode :
312802
Title :
Necessary and sufficient conditions for deadlock in manufacturing systems
Author :
Lipset, Robert ; Deering, Paul E. ; Judd, Robert P.
Author_Institution :
Dept. of Ind. & Manuf. Syst. Eng., Ohio Univ., Athens, OH, USA
Volume :
2
fYear :
1997
fDate :
4-6 Jun 1997
Firstpage :
1022
Abstract :
Scheduling resources to avoid deadlock in a manufacturing system has been studied extensively over the past decade. Previous work developed sufficient conditions to avoid deadlocked states. What distinguishes the different approaches is the number of nondeadlocked states that are allowed by the application of the method. This is an important consideration since in all the methods these non-deadlocked states are those with high resource allocation. This paper presents both sufficient and necessary conditions to determine deadlocked states in a manufacturing system. Several examples showing the applications of the theory are presented and are compared with other methods
Keywords :
graph theory; production control; resource allocation; set theory; deadlock avoidance; deadlocked states; manufacturing processes; manufacturing systems; necessary conditions; relation graphs; resource allocation; sufficient conditions; Computer industry; Computer science; Flexible manufacturing systems; Manufacturing industries; Manufacturing systems; Petri nets; Production; Sufficient conditions; System recovery; Systems engineering and theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
American Control Conference, 1997. Proceedings of the 1997
Conference_Location :
Albuquerque, NM
ISSN :
0743-1619
Print_ISBN :
0-7803-3832-4
Type :
conf
DOI :
10.1109/ACC.1997.609682
Filename :
609682
Link To Document :
بازگشت