By Topic

Deadlock avoidance for manufacturing systems with partially ordered process plans

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)
W. Sulistyono ; Sch. of Ind. Eng., Purdue Univ., West Lafayette, IN, USA ; M. A. Lawley

Most deadlock avoidance work in manufacturing deals with systems where each part type requires a fixed sequence of operations. In contrast, the paper deals with those systems that support sequencing flexibility, that is, the operations required by the part are partially ordered. In this setting, the order in which operations are performed is not predetermined but becomes a real-time decision. Specifically, the paper presents a detailed resource allocation model and proves the NP-completeness of optimal deadlock avoidance for a highly flexible subclass of these systems. It also identifies several cases and conditions for which optimal deadlock avoidance is of polynomial complexity

Published in:

IEEE Transactions on Robotics and Automation  (Volume:17 ,  Issue: 6 )