Fu-Shiung Hsieh

Dispatching-driven deadlock avoidance controller synthesis for flexible manufacturing systems

This paper develops a new method for synthesizing deadlock avoidance controllers (DACs) that realize job and machine dispatching policies of a flexible manufacturing system (FMS) into deadlock free control actions. Such controllers not only keep the FMS capable of repeating any of its operations, but also achieve a high resource utilization under any given dispatching policy. Our methodology is based on an untimed Petri net formalism. It consists of four ingredients: 1) a bottom-up approach for synthesizing a controlled production Petri net (CPPN) model of a FMS; 2) a necessary and sufficient liveness condition based on decomposition of the CPPN into controlled production subnets and the concept of minimal resource requirements; 3) a sufficient procedure to test whether the liveness condition is kept after a control action is executed; and 4) an algorithm that combines the test procedure with the given dispatching policy to generate valid and utilization maximizing control actions. We assess that this method is of polynomial time complexity and show that it results in a much larger class of controls than that of an existing deadlock avoidance scheme. >

Fault-tolerant deadlock avoidance algorithm for assembly processes

Unreliable resources pose challenges in design of deadlock avoidance algorithms as resources failures have negative impacts on scheduled production activities and may bring the system to dead states or deadlocks. This paper focuses on the development of a suboptimal polynomial complexity deadlock avoidance algorithm that can operate in the presence of unreliable resources for assembly processes. We formulate a fault-tolerant deadlock avoidance controller synthesis problem for assembly processes based on controlled assembly Petri net (CAPN), a class of Petri nets (PNs) that can model such characteristics as multiple resources and subassembly parts requirement in assembly production processes. The proposed fault-tolerant deadlock avoidance algorithm consists of a nominal algorithm to avoid deadlocks for nominal system state and an exception handling algorithm to deal with resources failures. We analyze the fault-tolerant property of the nominal deadlock avoidance algorithm based on resource unavailability models. Resource unavailability is modeled as loss of tokens in nominal Petri Net models to model unavailability of resources in the course of time-consuming recovery procedures. We define three types of token loss to model 1) resource failures in a single operation, 2) resource failures in multiple operations of a production process and 3) resource failures in multiple operations of multiple production processes. For each type of token loss, we establish sufficient conditions that guarantee the liveness of a CAPN after some tokens are removed. An algorithm is proposed to conduct feasibility analysis by searching for recovery control sequences and to keep as many types of production processes as possible continue production so that the impacts on existing production activities can be reduced.

Analysis of contract net in multi-agent systems

Application of contract net protocol requires the development of a bid evaluation procedure specific to the problem. Care must be taken to apply contract net protocol to tasks that involve precedence constraints among different operations and heterogeneous resources. The lack of a process model in the original contract net protocol makes it difficult to determine the feasibility of the resulting contracts. We propose a model to facilitate the development of the bid evaluation procedure by extending our previous results to handle tasks with more complex process structure. We formulate an optimization problem to find a minimal cost feasible execution sequence for a task.

Holarchy formation and optimization in holonic manufacturing systems with contract net

Holonic manufacturing systems (HMS) is based on the notion of holon, an autonomous, cooperative and intelligent entity to provide a econfigurable, flexible and decentralized manufacturing environment to respond to changing needs and opportunities. A set of holons that cooperate to achieve a goal forms a holarchy. How to design a mechanism to form a holarchy to achieve a goal while minimizing the overall cost is a challenge. The objectives of this paper are to propose models and develop collaborative algorithms to guide the holons to form a holarchy to coherently move toward the desired goal state ultimately. We adopt contract net protocol (CNP) to model mutual selection of holons in forming a holarchy. We formulate a holarchy optimization problem to minimize the cost subject to the feasibility constraints. To analyze the feasibility of a holarchy, a Petri net (PN) model is proposed. As classical PN models do not take into account the cost involved in firing transitions, we augment the PN model with cost functions in the problem formulation. Due to the distributed architecture of HMS, the internal structure of each potential holarchy that acts as bidder in CNP is not available to the manager. A key issue is to determine the feasibility of a holarchy without constructing the whole PN model of the given hierarchy. We study the feasible conditions for a holarchy and propose a collaborative algorithm to analyze the feasibility and award contracts to holons without constructing the whole model of a holarchy.

Robustness analysis of Petri nets for assembly/disassembly processes with unreliable resources

In most application of Petri nets, resources are modeled as tokens. Unreliable resources pose challenges as existing Petri net theory is deficient in analyzing the impacts of the perturbation due to resource failures. One strategy to analyze a perturbed system is to study its robustness with respect to uncertainties. In this paper, we study the robustness of a class of controlled Petri nets called controlled assembly/disassembly Petri net (CADPN) for assembly/disassembly processes with unreliable resources. The number of tokens in CADPN is not conservative to capture the effects of resource failures. Based on the CADPN model, we characterize different types of tolerable resource failures allowed for a nominal marking of a live CADPN. We show that liveness of a CADPN can still be preserved under tolerable resource failures.

Context-aware workflow management for virtual enterprises based on coordination of agents

Although virtual enterprises (VE) make it possible for small flexible enterprises to form a collaborative network to respond to business opportunities through dynamic coalition and sharing of the core competencies and resources, they also pose new challenges and issues. Creation of VE involves dynamically established partnerships between the partners and relies on a flexible coordination scheme. The dynamic organizations formed in VE present a challenge in the development of a new methodology to dynamically allocate re-sources and deliver the relevant information to the right people at the right time. A key issue is the development of an effective workflow management scheme for VE. Multi-agent systems (MAS) provide a flexible architecture to deal with changes based on dynamic organization and collaboration of autonomous agents. Despite the extensive studies and research results on MAS, development of a design methodology to support coordination and operations is critical to the success and adoption of VE. The objectives of this research are to propose a design methodology to facilitate coordination and development of context-aware workflow management systems and achieve effective resource allocation for VE based on MAS architecture. To achieve these objectives, a scheme for coordination of agents is proposed. Petri net models are used in the coordination scheme to describe workflows and capture resource activities in VE. The interactions between agents lead to a dynamic workflow model for VE. Based on the aforementioned model, we propose architecture to dynamically generate context-aware graphical user interface to guide the users and control resource allocation based on the state of VE. An order management example is used throughout this paper to illustrate the proposed design methodology.

Analysis of Flexible Assembly Processes Based on Structural Decomposition of Petri Nets

We propose a controlled assembly Petri net with alternative route (CAPN-AR) model for a class of flexible assembly processes with alternative routes and unreliable resources. Alternative routes significantly enhance the reliability through the routing flexibility of the system. It is not required for a CAPN-AR to be live to maintain production. For this reason, we propose the concept of persistent production for the CAPN-AR. However, alternative routes also add complexity to the analysis of the systems. As the PNs grow rapidly with the scale of the problem, an existing reachability-tree method is feasible only for small nets. We propose an analysis method that can scale with the problems based on structural decomposition of the CAPN-AR. We study the conditions for persistent production, propose a deadlock avoidance algorithm with polynomial complexity for CAPN-AR, and access its robustness property with respect to resource failures.

Assessing the benefits of group-buying-based combinatorial reverse auctions

Combinatorial reverse auctions represent a popular business model in procurement. For multiple buyers, different procurement models based on combinatorial reverse auctions may be applied. For example, each buyer may hold one combinatorial reverse auction independently. Alternatively, the buyers may delegate the auction to a group-buyer and let the group-buyer hold only one combinatorial reverse auction on behalf of all the buyers. A combination of a combinatorial reverse auctions with the group-buying model makes it possible to reduce the overall cost to acquire the required items significantly due to complementarities between items. However, combinatorial reverse auctions suffer from high computational complexity. To assess the advantage of combining group-buying with combinatorial reverse auctions, three issues must be addressed, including performance, computational efficiency and the scheme to reward the buyers. This motivates us to compare the performance and efficiency of the aforementioned two different combinatorial reverse auction models and to study the possible schemes to reward the buyers. To achieve these objectives, we first illustrate the advantage of group-buying-based combinatorial reverse auctions over multiple independent combinatorial reverse auctions. We then formulate the problems for these two combinatorial reverse auction models and propose solution algorithms for them. We compare performance and computational efficiency for these two combinatorial reverse auction models. Our analysis indicates that a group-buying-based combinatorial reverse auction not only outperforms multiple independent combinatorial reverse auctions but also is more efficient than multiple independent combinatorial reverse auctions. We also propose a non-uniform scheme to reward the buyers in group-buying based combinatorial reverse auctions.

Robustness of deadlock avoidance algorithms for sequential processes

Although deadlock avoidance issue has attracted much attention and has been extensively studied, most of the existing results assume reliable machines. This assumption makes it difficult to apply existing deadlock avoidance algorithms to real manufacturing systems with unreliable machines. This paper presents the results to apply an existing deadlock avoidance algorithm to systems with unreliable machines by analyzing the robustness of the deadlock avoidance algorithm. Sequential production processes are considered in this paper, and Petri Net is adopted as the tool for modeling and analysis of the sequential processes. Different types of tolerable machine failures under which liveness property can be preserved are characterized. Computational complexity of the proposed algorithm is analyzed.

Design of reconfiguration mechanism for holonic manufacturing systems based on formal models

One of the key design issues of holonic manufacturing systems (HMS) is to effectively respond to resource failures based on the flexible holonic architecture. The objective of this paper is to propose a viable design methodology to implement reconfiguration mechanism in HMS. A reconfiguration mechanism is developed to accommodate changes based on collaboration of holons without leading to chaos at the shop floor. To deal with resource failures in HMS, an impact function is defined to characterize the impact of resource failures on different holons in a holarchy. A collaborative reconfiguration mechanism based on an impact function is proposed to effectively reconfigure the systems to achieve minimal cost solutions. The design and implementation methodology combines contract net protocol for negotiation of holons, Petri net for the representation of individual product holons and resource holons and FIPA-compliant agent platform for publication/discovery of holons. A simulation system is developed to verify the proposed reconfiguration mechanism.