Deadlock avoidance policies for flexible manufacturing systems: the conjunctive case

S. A. Reveliotis, Placid Mathew Ferreira

Research output: Contribution to journalConference article

Abstract

Resolving the problem of the manufacturing system deadlock is emerging as a critical issue for effective planning and control in the agile manufacturing paradigm. It turns out that, in most cases, the problem is of nonpolynomial complexity, and its tractability strongly depends on the structure of the resource requests posed by the processed jobs. In our past work [5, 9, 10, 11, 12], we have formally analyzed the problem and provided solutions for the special class of FMS where every job requires a single resource unit at every processing stage, namely, a unit of buffer space on the supporting workstation. In this paper, we extend the analysis and one of the previously developed policies - the Resource Upstream Neighborhood (RUN) policy - so that they apply to FMS's in which every job requires a collection of resources for the execution of a single processing stage.

Original languageEnglish (US)
Pages (from-to)533-538
Number of pages6
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume1
StatePublished - Jan 1 1996
EventProceedings of the 1996 13th IEEE International Conference on Robotics and Automation. Part 1 (of 4) - Minneapolis, MN, USA
Duration: Apr 22 1996Apr 28 1996

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Deadlock avoidance policies for flexible manufacturing systems: the conjunctive case'. Together they form a unique fingerprint.

  • Cite this