Deadlock avoidance for manufacturing systems with partially ordered process plans
Academic Article
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
Most deadlock avoidance work in manufacturing deals with systems where each part type requires a fixed 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 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.