Close category search window
 

Towards an optimal deadlock avoidance algorithm for flexible manufacturing systems

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
$31 $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

4 Author(s)
Gurov, D.B. ; Dept. of Comput. Sci., Victoria Univ., BC, Canada ; Muller, H.A. ; Kapron, B.M. ; Escalante, M.A.

In this paper a new conceptual framework for investigating the deadlock avoidance problem in flexible manufacturing systems (FMSs) is introduced. The aim of the framework is to capture the production route information, which is relevant to deadlock avoidance, and more specifically to avoidance of circular wait situations. Three sources of circular wait situations in FMSs are identified. Based on these, a deadlock avoidance algorithm is presented, which is a restriction policy that is less restrictive than others presented earlier, and is in our opinion a step towards finding an optimal (least restrictive) restriction policy

Published in:
Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on  (Volume:5 )

Date of Conference: 22-25 Oct 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.