Deadlock-free scheduling strategy for automated production cell

Deadlock must be avoided in a manufacturing system. In this paper, an efficient algorithm for finding a good deadlock-free schedule in a manufacturing system with enough (sufficient) or limited buffer is presented. This algorithm is based on the effective genetic algorithm (GA) search method. A formal Petri net structure is introduced, and the token player is used to assure deadlock freeness. In order to make the scheduling strategy generated by GA meet the required deadlock-free constraint, a Petri net is involved in checking the implementation of a manufacturing system during the job-scheduling process. The effectiveness and efficiency of the proposed approach is illustrated by several examples.

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

[2]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[3]  MengChu Zhou,et al.  Deadlock-free scheduling of an automated manufacturing system based on Petri nets , 1997, Proceedings of International Conference on Robotics and Automation.

[4]  Hongnian Yu,et al.  An evolutionary hybrid scheduler based in Petri net structures for FMS scheduling , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[5]  Zhiming Wu,et al.  A Genetic Algorithm Approach to the Scheduling of FMSs with Multiple Routes , 2001 .

[6]  Li-Chen Fu,et al.  Petri net based modeling and GA based scheduling for a flexible manufacturing system , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[7]  Li-Chen Fu,et al.  Petri-net and GA-based approach to modeling, scheduling, and performance evaluation for wafer fabrication , 2000, IEEE Trans. Robotics Autom..

[8]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[9]  Claude Jard,et al.  Modeling and Verification of Parallel Processes , 2001, Lecture Notes in Computer Science.

[10]  Y. Song,et al.  A genetic algorithm with a machine order-based representation scheme for a class of job shop scheduling problem , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[11]  Hoda A. ElMaraghy,et al.  Deadlock prevention and avoidance in FMS: A Petri net based approach , 1998 .

[12]  Xu Gang,et al.  Deadlock-free scheduling method using Petri net model analysis and GA search , 2002, Proceedings of the International Conference on Control Applications.

[13]  K. Barkaoui,et al.  A deadlock prevention method for a class of FMS , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[14]  Mitsuo Gen,et al.  Solving job-shop scheduling problems by genetic algorithm , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[15]  Bruce H. Krogh,et al.  Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows , 1990, IEEE Trans. Robotics Autom..

[16]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[17]  MengChu Zhou,et al.  Avoiding deadlock and reducing starvation and blocking in automated manufacturing systems , 2001, IEEE Trans. Robotics Autom..

[18]  Y. Narahari,et al.  Deadlock prevention and deadlock avoidance in flexible manufacturing systems using Petri net models , 1990, IEEE Trans. Robotics Autom..