FMS scheduling using Petri nets and heuristic search

A method for scheduling of flexible manufacturing systems by merging Petri net modeling and heuristic search is presented. The method uses the Petri net model to generate and search a partial reachability graph, and presents an optimal or near-optimal schedule in terms of a firing sequence of transitions of the Petri net model of the system. This method can easily handle routing flexibility and shared resources. Taking this approach also relieves the analytical burden since it becomes less urgent to analyze the large net to guarantee freedom from deadlock, or liveliness once an optimal schedule is developed. Some heuristic functions to guide the search are explored, and preliminary results and the search algorithm are presented.<<ETX>>

[1]  K. Preston White,et al.  A recent survey of production scheduling , 1988, IEEE Trans. Syst. Man Cybern..

[2]  Krishna R. Pattipati,et al.  Schedule generation and reconfiguration for parallel machines , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[3]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[4]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

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

[6]  Joseph Sifakis.  Performance Evaluation of Systems Using Nets , 1979, Advanced Course: Net Theory and Applications.

[7]  Manuel Silva Suárez,et al.  Petri nets and flexible manufacturing , 1988, European Workshop on Applications and Theory in Petri Nets.

[8]  Peter B. Luh,et al.  A job completion time estimation method for work center scheduling , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[9]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[10]  Bruce H. Krogh,et al.  Essentially decision free Petri nets for real-time resource allocation , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[11]  Jean-Marie Proth,et al.  Performance evaluation of job-shop systems using timed event-graphs , 1989 .

[12]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[13]  Peter B. Luh,et al.  Distributed scheduling of job shops , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[14]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  C. V. Ramamoorthy,et al.  Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets , 1980, IEEE Transactions on Software Engineering.

[16]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[17]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[18]  William L. Maxwell,et al.  Theory of scheduling , 1967 .