摘要
本文从实际出发,提出一个m×n工序统筹图模型。给出了该问题的可行解存在判别定理和最优解判别定理,并设计了一个求该问题最优解的以O(m^9/2·n^2)时间为界的多项式算法,使问题得到了基本解决。
In this article,a model of m×n working process plotting diagram is brought up practically.An existing judgement theorem of feasible solution and a judgement theorem of optimal solution to the problem are given here.Moreover,a polynomial algorithm for finding the optimal solution bounded by O(m^9/~2·n^2)is designed. This the problem has been fundamentally solved.
出处
《长沙铁道学院学报》
CSCD
1990年第4期49-55,共7页
Journal of Changsha Railway University
关键词
工序统筹图
网络
关键路
图论
working process plotting diagram
nelwork
keyroad
