In this paper a generic dynamic model for process planning is presented, based on Petri net technology. The proposed Petri net model 1) represents manufacturing knowledge of the type of precedence relations constraints 2) represents dynamically the process planning procedure itself, and 3) encapsulates all possible process planning solutions (process plans). Furthermore, process planning simulation can be performed directly on the Petri net and reachability analysis of the model gives the complete set of solutions (process plans). Then, optimum solutions can be found by using a method based on heuristics.

This content is only available via PDF.
You do not currently have access to this content.