A kind of deadlock-free scheduling method based on Petri net

In this paper an efficient algorithm for finding an optimal deadlock-free schedules in a flexible manufacturing system (FMS) modeled by a kind of Petri net, systems of simple sequential processes with shared resources (S/sup 4/R) nets, is presented. This algorithm is based on the effective genetic algorithm (GA) search method, and the structural elements analysis of Petri net. In order to find the optimum and deadlock-free scheduling strategy from the population generated by GA, Petri net structural analysis procedure is involved as a criterion to select among population and make the job scheduling deadlock-free. The effectiveness and efficiency of the proposed approach is illustrated using an example at the end of the paper.

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

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

[4]  Erwin R. Boer,et al.  Generating basis siphons and traps of Petri nets using the sign incidence matrix , 1994 .

[5]  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.

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

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

[8]  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.

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

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

[11]  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).

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

[13]  Andrew Y. C. Nee,et al.  Using genetic algorithms in process planning for job shop machining , 1997, IEEE Trans. Evol. Comput..

[14]  H.A. ElMaraghy,et al.  A logic programming approach for finding minimal siphons in S/sup 3/PR nets applied to manufacturing systems , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.