Deadlock-Free Genetic Scheduling Algorithm for Automated Manufacturing Systems Based on Deadlock Control Policy

Deadlock-free control and scheduling are vital for optimizing the performance of automated manufacturing systems (AMSs) with shared resources and route flexibility. Based on the Petri net models of AMSs, this paper embeds the optimal deadlock avoidance policy into the genetic algorithm and develops a novel deadlock-free genetic scheduling algorithm for AMSs. A possible solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the one-step look-ahead method in the optimal deadlock control policy, the feasibility of a chromosome is checked, and infeasible chromosomes are amended into feasible ones, which can be easily decoded into a feasible deadlock-free schedule. The chromosome representation and polynomial complexity of checking and amending procedures together support the cooperative aspect of genetic search for scheduling problems strongly.

[1]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[2]  Gonca Tuncel,et al.  Applications of Petri nets in production scheduling: a review , 2007 .

[3]  MengChu Zhou,et al.  Optimal Petri-Net-Based Polynomial-Complexity Deadlock-Avoidance Policies for Automated Manufacturing Systems , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[4]  Naiqi Wu,et al.  System Modeling and Control with Resource-Oriented Petri Nets , 2009 .

[5]  Maria Pia Fanti.  Deadlock resolution strategy for automated manufacturing systems including conjunctive resource service , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[6]  Zhiwu Li,et al.  Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach , 2009 .

[7]  Maria Pia Fanti,et al.  Comparing digraph and Petri net approaches to deadlock avoidance in FMS , 2000, IEEE Trans. Syst. Man Cybern. Part B.

[8]  Mark A. Lawley,et al.  Deadlock avoidance for production systems with flexible routing , 1999, IEEE Trans. Robotics Autom..

[9]  MengChu Zhou,et al.  Deadlock Resolution in Automated Manufacturing Systems With Robots , 2007, IEEE Transactions on Automation Science and Engineering.

[10]  Zhiming Wu,et al.  Deadlock-free scheduling strategy for automated production cell , 2004, IEEE Trans. Syst. Man Cybern. Part A.

[11]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[12]  Manoj Kumar Tiwari,et al.  Deadlock-free scheduling of an automated manufacturing system using an enhanced colored time resource Petri-net model-based evolutionary endosymbiotic learning automata approach , 2007 .

[13]  MengChu Zhou,et al.  Deadlock control methods in automated manufacturing systems , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[14]  Haoxun Chen,et al.  Deadlock avoidance policy for Petri-net modeling of flexible manufacturing systems with shared resources , 1996 .

[15]  MengChu Zhou,et al.  Scheduling of semiconductor test facility via Petri nets and hybrid heuristic search , 1998 .

[16]  Beno Benhabib,et al.  Deadlock-free scheduling and control of flexible manufacturing cells using automata theory , 2006, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[17]  Hoda A. ElMaraghy,et al.  Deadlock-free scheduling in flexible manufacturing systems using Petri nets , 2002 .

[18]  Hoda A. ElMaraghy,et al.  Real-time scheduling with deadlock avoidance in flexible manufacturing systems , 2003 .

[19]  Li-Chen Fu,et al.  Modeling, scheduling, and performance evaluation for wafer fabrication: a queueing colored Petri-net and GA-based approach , 2006, IEEE Trans Autom. Sci. Eng..

[20]  Feng Chu,et al.  Deadlock analysis of Petri nets using siphons and mathematical programming , 1997, IEEE Trans. Robotics Autom..

[21]  MengChu Zhou,et al.  Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets , 2007, OR Spectr..

[22]  Javier Martínez,et al.  A Petri net based deadlock prevention policy for flexible manufacturing systems , 1995, IEEE Trans. Robotics Autom..

[23]  MengChu Zhou,et al.  Resource-Oriented Petri Net for Deadlock Avoidance in Flexible Assembly Systems , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[24]  Mengchu Zhou,et al.  Elementary Siphons of Petri Nets and Deadlock Control , 2004 .

[25]  Mark Lawley,et al.  Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems , 1997, IEEE Trans. Autom. Control..

[26]  Sanjay B. Joshi,et al.  Deadlock-free schedules for automated manufacturing workstations , 1996, IEEE Trans. Robotics Autom..

[27]  Xu Gang,et al.  Deadlock-free scheduling strategy for automated production cell , 2003, Proceedings 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003).

[28]  Spyros A. Reveliotis,et al.  Deadlock avoidance policies for automated manufacturing cells , 1996, IEEE Trans. Robotics Autom..

[29]  MengChu Zhou,et al.  Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems , 2004, IEEE Trans. Syst. Man Cybern. Part A.

[30]  MuDer Jeng,et al.  A Heuristic Search Approach Using Approximate Solutions to Petri Net State Equations for Scheduling Flexible Manufacturing Systems , 1998 .

[31]  MengChu Zhou,et al.  Resource-Transition Circuits and Siphons for Deadlock Control of Automated Manufacturing Systems , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[32]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .