Graph-theoretic deadlock detection and resolution for flexible manufacturing systems

Abstract

Flexible manufacturing systems are capable of producing a broad variety of products and changing their characteristics quickly and frequently. This flexibility provides for more efficient use of resources, but makes control of these systems more difficult. Control problems previously unstudied now require practical resolution, like system deadlock. A system deadlock is a situation that arises due to resource sharing in manufacturing systems, when the flow of parts is permanently inhibited andlor operations on parts cannot be performed. This problem has been ignored by most scheduling and control studies, which usually assume infinite machine queue capacity and unlimited tooling resources. FMS's, however, have little or no queue capacity and limited tooling resources. In this paper, graph-theoretic deadlock detection and resolution procedures are presented which are suitable for real-time control of manufacturing systems. These procedures determine whether part movement in the system causes system deadlock or not. To this end, a system status graph representing part routings is virtually updated for every part movement before parts move physically to the next destination. Two types of system deadlocks, part flow deadlock and impending part flow deadlock, are detected using the updated system status graph. If a deadlock detection and recovery method is used to recover from a deadlock using a storage buffer, only part flow deadlocks need to be detected. On the other hand, if no buffer is available, both types of existing as well as impending system deadlocks need to be detected to avoid a deadlock situation.

Optimality Test for Control Places of Petri Net Based Liveness Enforcing Supervisors of FMSs

“…The past three decades have witnessed very fruitful investigations on deadlock resolution in FMSs [1-47, 49, 51-56]. The following topics are three major methodologies to deal with the deadlock problems in FMSs [16]: deadlock avoidance [2, 3, 6, 9, 10-13, 15-19, 22, 23), deadlock detection and recovery [4,5,8], and deadlock prevention [2,7,14,16,19,20,22,24,26,28,[31][32][33][34][35][36][37][38][39][40][41][42][43][44][45][46][47][52][53][54][55][56]. Graph-based techniques [8,11,13], finite state machine-based models [15] and Petri net models [2, 3, 6, 7, 9, 16, 17, 19-28, 30-47, 51-56] have been utilized for deadlock analysis and control.…”

“…The following topics are three major methodologies to deal with the deadlock problems in FMSs [16]: deadlock avoidance [2, 3, 6, 9, 10-13, 15-19, 22, 23), deadlock detection and recovery [4,5,8], and deadlock prevention [2,7,14,16,19,20,22,24,26,28,[31][32][33][34][35][36][37][38][39][40][41][42][43][44][45][46][47][52][53][54][55][56]. Graph-based techniques [8,11,13], finite state machine-based models [15] and Petri net models [2, 3, 6, 7, 9, 16, 17, 19-28, 30-47, 51-56] have been utilized for deadlock analysis and control. Owing to their ability to detect desirable behavioral properties of a system such as boundedness and deadlock-freeness, Petri nets (PNs) are extensively employed as an important vehicle to characterize FMSs [16].…”

Dispatching Automated Guided Vehicles in a Container Terminal

“…The technique needs matrix vector operations in very large dimensions. Hyuenbo et al [12] use graph theory to detect impending deadlock situations.…”

Ambiente para o projeto de intertravamentos utilizando redes de Petri

“…Esta é uma abordagem dinâmica que utiliza uma política de se prever se no próximo passo há a possibilidade de "deadlocks". Cho et. al (CHO et al, 1995) aborda o 'ldead!ock'\ considerando que o sistema Já está travado.…”