By Topic

Deadlock avoidance policies for flexible manufacturing systems: the conjunctive case

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. A. Reveliotis ; Dept. of Mech. & Ind. Eng., Illinois Univ., Urbana, IL, USA ; P. M. Ferreira

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. The authors have previously (1994, 1995) 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

Published in:

Robotics and Automation, 1996. Proceedings., 1996 IEEE International Conference on  (Volume:1 )

Date of Conference:

22-28 Apr 1996