工艺计划选择的图论方法

Kusiak和Finke讨论了工艺计划选择问题,并对此建立了图论和整数规划模型。本文给出一个修改的模型,模型求解归结为求非循环有向图的最短路径,使问题求解大为简化。

In this paper we propose a modified formulation for the problm discussed in CO. The solutiou of the problem modeled by the new formulation is to find the shortest path between two nodes in an acyclic digraph and the computional complexity is reduced greatly in this way.

863 CIMS专题资助课题