An efficient real-time deadlock-free control algorithm for automated manufacturing systems

Chang Ouk Kim, S. S. Kim

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

In recent years, deadlock issue has received considerable attention in the real-time control realm of automated manufacturing system (AMS). In this paper, we propose a simple and easily adaptable deadlock avoidance algorithm using a graph theoretic approach. Unlike Petri-net based methods which are complex and static from the viewpoint that once they are constructed and implemented, it is not easy to modify them as the system configuration is changed, and operate them coupled with other shop-floor control modules such as a dispatching controller, our algorithm can be used cooperatively with a dispatching controller and expanded with little modification. The core of the algorithm consists of two modules: resource allocation policy and a cycle detection method. In particular, the resource allocation policy is of importance in our algorithm because even though the cycle detection method is employed, deadlock may occur under wrong resource allocation policies. Throughout this paper, we propose a quasi two-step resourceallocation policy with which our deadlock avoidance algorithm can detect and avoid deadlock just one step before deadlock.

Original languageEnglish
Pages (from-to)1545-1560
Number of pages16
JournalInternational Journal of Production Research
Volume35
Issue number6
DOIs
Publication statusPublished - 1997 Jan 1

Fingerprint

Resource allocation
Controllers
Real time control
Petri nets
Deadlock
Manufacturing systems
Avoidance
Dispatching
Module
Controller

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{28eca96326734695a816b20355238f81,
title = "An efficient real-time deadlock-free control algorithm for automated manufacturing systems",
abstract = "In recent years, deadlock issue has received considerable attention in the real-time control realm of automated manufacturing system (AMS). In this paper, we propose a simple and easily adaptable deadlock avoidance algorithm using a graph theoretic approach. Unlike Petri-net based methods which are complex and static from the viewpoint that once they are constructed and implemented, it is not easy to modify them as the system configuration is changed, and operate them coupled with other shop-floor control modules such as a dispatching controller, our algorithm can be used cooperatively with a dispatching controller and expanded with little modification. The core of the algorithm consists of two modules: resource allocation policy and a cycle detection method. In particular, the resource allocation policy is of importance in our algorithm because even though the cycle detection method is employed, deadlock may occur under wrong resource allocation policies. Throughout this paper, we propose a quasi two-step resourceallocation policy with which our deadlock avoidance algorithm can detect and avoid deadlock just one step before deadlock.",
author = "Kim, {Chang Ouk} and Kim, {S. S.}",
year = "1997",
month = "1",
day = "1",
doi = "10.1080/002075497195119",
language = "English",
volume = "35",
pages = "1545--1560",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "6",

}

An efficient real-time deadlock-free control algorithm for automated manufacturing systems. / Kim, Chang Ouk; Kim, S. S.

In: International Journal of Production Research, Vol. 35, No. 6, 01.01.1997, p. 1545-1560.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient real-time deadlock-free control algorithm for automated manufacturing systems

AU - Kim, Chang Ouk

AU - Kim, S. S.

PY - 1997/1/1

Y1 - 1997/1/1

N2 - In recent years, deadlock issue has received considerable attention in the real-time control realm of automated manufacturing system (AMS). In this paper, we propose a simple and easily adaptable deadlock avoidance algorithm using a graph theoretic approach. Unlike Petri-net based methods which are complex and static from the viewpoint that once they are constructed and implemented, it is not easy to modify them as the system configuration is changed, and operate them coupled with other shop-floor control modules such as a dispatching controller, our algorithm can be used cooperatively with a dispatching controller and expanded with little modification. The core of the algorithm consists of two modules: resource allocation policy and a cycle detection method. In particular, the resource allocation policy is of importance in our algorithm because even though the cycle detection method is employed, deadlock may occur under wrong resource allocation policies. Throughout this paper, we propose a quasi two-step resourceallocation policy with which our deadlock avoidance algorithm can detect and avoid deadlock just one step before deadlock.

AB - In recent years, deadlock issue has received considerable attention in the real-time control realm of automated manufacturing system (AMS). In this paper, we propose a simple and easily adaptable deadlock avoidance algorithm using a graph theoretic approach. Unlike Petri-net based methods which are complex and static from the viewpoint that once they are constructed and implemented, it is not easy to modify them as the system configuration is changed, and operate them coupled with other shop-floor control modules such as a dispatching controller, our algorithm can be used cooperatively with a dispatching controller and expanded with little modification. The core of the algorithm consists of two modules: resource allocation policy and a cycle detection method. In particular, the resource allocation policy is of importance in our algorithm because even though the cycle detection method is employed, deadlock may occur under wrong resource allocation policies. Throughout this paper, we propose a quasi two-step resourceallocation policy with which our deadlock avoidance algorithm can detect and avoid deadlock just one step before deadlock.

UR - http://www.scopus.com/inward/record.url?scp=0031169498&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031169498&partnerID=8YFLogxK

U2 - 10.1080/002075497195119

DO - 10.1080/002075497195119

M3 - Article

AN - SCOPUS:0031169498

VL - 35

SP - 1545

EP - 1560

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 6

ER -