加工中的最优切割方式

The Optimal Cutting Method in the Course of Processing

就工业生产中如何安排加工次序的组合优化问题，建立了一个数学模型，将问题转化为求一种分层网络的最短路径。结合问题的特点对求最短路径的Dijkstra标号法进行了改进，得到了一个新算法，该算法能快速求出这种分层网络中的最短路径。

Establish a maths model about the combinatorial optimum problem how to arrange processing orders in the industrial production,changing the problem into seeking the shortest path of stratified networks, improvc the Dijkstra labeling mcthod in seeking the shortest path and obtain a new algorithm by combining the characteristics of the problem. This algorlthm can rapidly find the shortest path of the stratified networks.