Abstract The problem under consideration is the cost estimation of operation sequencing for non-linear process planning, i.e. taking into account processing alternatives. In order to determine overall costs for feasible process plans we take into account in our Petri net model costs caused by machine, setup and tool changing in addition to the single operation cost. We introduce a new Petri net model that allows the application of cost analysis algorithms. This is a PP-net (Process Planning net) which represents manufacturing knowledge in the form of precedence constraints and incorporates machining cost, machine, setup and tool information in each transition. We show that the PP-net allows the calculation of the optimum process plan without the need to first develop all possible solutions. We apply the developed methods and calculate the optimum process plan to an industrial case study of a mechanical workpiece of moderate complexity.
[1]
Alfred V. Aho,et al.
Data Structures and Algorithms
,
1983
.
[2]
Inyong Ham,et al.
Computer-Aided Process Planning: The Present and the Future
,
1988
.
[3]
Hong-Chao Zhang,et al.
Computer Aided Process Planning: the state-of-the-art survey
,
1989
.
[4]
Krishnaswami Srihari,et al.
Petri nets in dynamic process planning
,
1990
.
[5]
Jean-Pierre Kruth,et al.
A CAPP System for Nonlinear Process Plans
,
1992
.
[6]
K. Srihari,et al.
A review of petri-net applications in manufacturing
,
1992
.
[7]
Dimitris Kiritsis,et al.
A generic Petri net model for dynamic process planning and sequence optimization
,
1996
.