DocumentCode :
306863
Title :
Deadlock avoidance policies for resource allocation systems with applications to FMS
Author :
Ferreira, P.M. ; Lawley, M.A. ; Reveliotis, S.A.
Author_Institution :
Dept. of Mech. & Ind. Eng., Illinois Univ., Urbana, IL, USA
Volume :
1
fYear :
1996
fDate :
18-21 Nov 1996
Firstpage :
42
Abstract :
The problem of deadlock avoidance for a class of resource allocation systems (RAS) called the single-unit RAS (SU-RAS) is discussed with particular application to buffer space allocation in a flexible manufacturing system. For a class of SU-RAS, it is shown that the problem of obtaining the maximally permissive deadlock avoidance policy is of polynomial complexity. Sub-optimal policies (which are not maximally permissive) for SU-RAS are also discussed
Keywords :
computational complexity; flexible manufacturing systems; resource allocation; FMS; buffer space allocation; deadlock avoidance policies; polynomial complexity; single unit resource allocation systems; Automatic control; Automation; Control systems; Flexible manufacturing systems; Polynomials; Process planning; Production; Resource management; Size control; System recovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Emerging Technologies and Factory Automation, 1996. EFTA '96. Proceedings., 1996 IEEE Conference on
Conference_Location :
Kauai, HI
Print_ISBN :
0-7803-3685-2
Type :
conf
DOI :
10.1109/ETFA.1996.573253
Filename :
573253
Link To Document :
بازگشت