科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper presents a new scheduling method for a flexible manufacturing system (FMS) in a Petri net framework. Petri nets can concisely model multiple lot sizes for each job, the strict precedence constraint, multiple kinds of resources, and concurrent activities. To decrease the likelihood of rejecting the critical markings, our algorithm adopts an improved checking method for previous generated marking. To reduce the computation complexity, an elaborate scheme is applied, which performs A* search locally and backtracking search globally in the reachability graph of the Petri net. Some numerical experiments are carried out to demonstrate usefulness of the algorithm.
- 出版日期2010-6
- 单位南京理工大学
