Abstract
Deadlock avoidance policies guarantee deadlock-free resource allocation to concurrent competing processes in flexible manufacturing systems. Most deadlock avoidance work in manufacturing deals with systems where each part requires a fired sequence of operations. In contrast, this 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 characterizes the deadlock detection and avoidance problems for these systems, presents a sub-optimal deadlock avoidance approach, and addresses two relevant special structures on the partial orders for which optimal deadlock avoidance is of polynomial complexity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
