An Efficient Search Algorithm for Deadlock-Free Scheduling in FMS Using Petri Nets
暂无分享,去创建一个
[1] Takashi Sekiguchi,et al. A timed Petri net and beam search based online FMS scheduling system with routing flexibility , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[2] Kamel Barkaoui,et al. On Liveness and Controlled Siphons in Petri Nets , 1996, Application and Theory of Petri Nets.
[3] Wil M. P. van der Aalst. Interval Timed Coloured Petri Nets and their Analysis , 1993, Application and Theory of Petri Nets.
[4] L. Shen,et al. Truncation of Petri net models for simplifying computation of optimum scheduling problems , 1992 .
[5] 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.
[6] Sanjay B. Joshi,et al. Deadlock-free schedules for automated manufacturing workstations , 1996, IEEE Trans. Robotics Autom..
[7] Hoda A. ElMaraghy,et al. Deadlock prevention and avoidance in FMS: A Petri net based approach , 1998 .
[8] R. Haupt,et al. A survey of priority rule-based scheduling , 1989 .
[9] Frank DiCesare,et al. FMS scheduling using Petri nets and heuristic search , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[10] Javier Martínez,et al. A Petri net based deadlock prevention policy for flexible manufacturing systems , 1995, IEEE Trans. Robotics Autom..
[11] 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.