Scheduling FMS with alternative routings using Petri nets and near admissible heuristic search

作者：Huang Bo^*; Shi Xing Xi; Xu Nan

来源：International Journal of Advanced Manufacturing Technology, 2012, 63(9-12): 1131-1136.

DOI：10.1007/s00170-012-3958-x

• Petri nets
• Manufacturing strategy
• Scheduling
• Heuristics

This paper proposes and evaluates a near admissible heuristic search strategy and its application to a kind of flexible manufacturing system (FMS) scheduling in a Petri net framework. Petri nets can concisely model the strict precedence constraint, multiple kinds of resources, and concurrent activities. To cope with the complexities for scheduling of FMS with alternative routings, this paper proposes an admissible heuristic function based on the execution of P-timed Petri nets and presents an improved dynamic weighting A* strategy using the proposed heuristic function. The search scheme does not need to predict the depth of solution in advance and the quality of the search result is also controllable. Some numerical experiments are carried out to demonstrate usefulness of the algorithm.

• 出版日期2012-12
• 单位南京理工大学