• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.8 s.179
• /
• pp.2131-2142
• /
• 2000

As recent production facilities are usually operated with unmanned material-handling system, the development of an efficient schedule with deadlock avoidance becomes a critical problem. Related researches on deadlock avoidance usually focus on real-time control of manufacturing system using deadlock avoidance policy. But little off-line optimization of deadlock-free schedule has been reported. This paper presents an optimization method for deadlock-free scheduling for Job-Shop system with no buffer. The deadlock-free schedule is acquired by the procedure that generates candidate lists of waiting operations, and applies a deadlock avoidance policy. To verify the proposed approach, simulation resultsare presented for minimizing makespan in three problem types. According to the simulation results the effect of each deadlock avoidance policy is dependent on the type of problem. When the proposed LOEM (Last Operation Exclusion Method) is employed, computing time for optimization as well as makespan is reduced.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.3
• /
• pp.443-451
• /
• 2001

This paper addresses an on-line scheduling method for track systems in semiconductor fabrication. A track system is a clustered equipment performing photolithography process in semiconductor fabrication. Trends toward high automation and flexibility in the track systems accelerate the necessity of the intelligent controller that can guarantee reliability and optimize productivity of the track systems. This paper proposes an-efficient on-line scheduling method that can avoid deadlock inherent to track systems and optimize the productivity. We employ two procedures for the on-line scheduling. First, we define potential deadlock set to apply deadlock avoidance policy efficiently. After introducing the potential deadlock set, we propose a deadlock avoidance policy using an on-line Gantt chart, which can generate optimal near-optimal schedule without deadlock. The proposed on-line scheduling method is shown to be efficient in handling deadlock inherent to the track systems through simulation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.58
• /
• pp.49-58
• /
• 2000

In order to resolve a deadlock problem in manufacturing systems, three main methods have been proposed-prevention, avoidance, and recovery. The prevention and avoidance methods require predicting deadlocks in advance in order to prohibit them. In contrast, the recovery method allows a system to enter a deadlock state, then resolves it usually using a common buffer. In this paper, a deadlock recovery method considering the impact of flexible job routings is proposed. This method is based on capacity-designated directed graph (CDG) model representing current requesting and occupying relations between Jobs and resources in order to detect a deadlock and then recovers it.

• The Journal of Engineering Research
• /
• v.1 no.1
• /
• pp.49-57
• /
• 1997

In this paper, the follow-up works of Habermann's deadlock avoidance algorithm is investigated from the view of correction, efficiency and concurrency. Habermann's deadlock avoidance algorithm is briefly surveyed and in-depth discussion of follow-up algorithms modified and improved is presented. Then, further improvement of Kameda's algorithm will be discussed. His algorithm for testing deadlock-freedom in computer system converts the Habermann's model into a labeled bipartite graph so that the deadlock detection problem can be equivalent to finding complete matching for Mormon marriage problem. His algorithm has a running time of O($mn^1.5$) because Dinic's algorithm is used. The speed of above algorithm can be enhanced by employing a faster algorithm for finding a maximal matching. The wave method by Kazanov is used for.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.230-236
• /
• 2022

Objectives: The primary goal of this article is to compare the multiple algorithms used for deadlock handling methods and then outline the common method in deadlock handling methods. Methods: The article methodology begins with introducing a literature review studying different algorithms used in deadlock detection and many algorithms for deadlocks prevented, recovered, and avoided. Discussion and analysis of the literature review were done to classify and compare the studied algorithms. Findings: The results showed that the deadlock detection method solves the deadlock. As soon as the real-time deadlock detection algorithm is identified and indicated, it performs better than the non-real-time deadlock detection algorithm. Our novelty the statistics that we get from the percentages of reviewing outcomes that show the most effective rate of 47% is in deadlock prevention. Then deadlock detection and recovery with 28% finally, a rate of 25% for deadlock avoidance.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.1-10
• /
• 2006

The Flexible Management System (FMS) consists of parallel and concurrent machines, pieces of equipment, and carrying systems classified as buffers, tools, and routers, respectively. The concurrent flow of multiple productions in a system is competed with one another for resources and this resulting competition can cause a deadlock in FMS. Since a deadlock is a condition in which the excessive demand for the resources being used by others causes activities to stop, it is very important to detect and prevent a deadlock. Herein a new algorithm has been studied in order to detect and prevent deadlocks, after defining a relationship between the general places and resource share places in Petri nets like as DAPN: Deadlock Avoidance Petri Net. For presenting the results, the suggested algorithms were also adapted to the models that demonstrated FMS features.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.4
• /
• pp.344-352
• /
• 2005

The modem production systems are required to produce many items. This is due to the fact that society has become more complex and the customers' demands have become more varied. The demand for complex production systems of various purposes, which can flexibly change the content of work, has increased. One of such production systems is FMS (Flexible Manufacturing System). Limited resources must be used in FMS when a number of working procedures are simultaneously being undertaken because the conditions of stand-by job processes cannot be changed. Researchers are currently being conducted to determine ways of preventing deadlocks. In this study, we proposes the algorithm for detection and recovery of a deadlock status using the DDAPN(Deadlock Detection Avoidance Petri Net). Also, we apply the proposed algorithm has a feature to the FMS.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.8
• /
• pp.585-593
• /
• 2004

Fault-tolerant gait planning in legged locomotion is to design gaits with which legged robots can maintain static stability and motion continuity against a failure in a leg. For planning a robust and deadlock-free fault-tolerant gait, kinematic constraints caused by a failed leg should be closely examined with respect to remaining mobility of the leg. In this paper, based on the authors's previous results, deadlock avoidance scheme for fault-tolerant gait planning is proposed for a hexapod robot walking over even terrain. The considered fault is a locked joint failure, which prevents a joint of a leg from moving and makes it locked in a known position. It is shown that for guaranteeing the existence of the previously proposed fault-tolerant tripod gait of a hexapod robot, the configuration of the failed leg must be within a range of kinematic constraints. Then, for coping with failure situations where the existence condition is not satisfied, the previous fault-tolerant tripod gait is improved by including the adjustment of the foot trajectory. The foot trajectory adjustment procedure is analytically derived to show that it can help the fault-tolerant gait avoid deadlock resulting from the kinematic constraint and does not make any harmful effect on gait mobility. The post-failure walking problem of a hexapod robot with the normal tripod gait is addressed as a case study to show the effectiveness of the proposed scheme.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2298-2300
• /
• 2003

본 논문은 페트리 네트의 특별한 구조인 siphon의 특성을 이용하여 트랜지션 점화를 제어함으로써 deadlock을 회피하는 방법을 제시한다. 제안한 방법은 페트리 네트에서 상태 방정식을 유도한 후, siphon의 특성을 이용하여 deadlock을 회피할 수 있는 충분 조건을 유도한다. 간단한 FMS의 예를 이용하여 제안한 방법을 사용하면 deadlock이 발생하지 않음을 보인다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.392-401
• /
• 2000

In this work, a deadlock avoidance strategy is proposed in order to effectively handle conflicts and deadlocks occurring in zone-control AGV (Automated Guided Vehicle) systems. The basic idea is based on Capacity-designated Directed Graph (CDG) theory that was developed to avoid from deadlocks in manufacturing systems. However, to enforce the effectiveness of detecting impending and restricted deadlocks, AGV routings are explicitly described in Extended Directed Graph (EDG). From EDG, a non-conservative deadlock-avoidance strategy is derived. The superiority of the proposed strategy lies on the applicability to diverse AGV path configurations using zone control. Also, because of its insensibility and robustness, it can be effectively used when the system has randomness and stochastic nature.