摘要
CPM网络图中平行工序的顺序优化问题是网络计划分析的一个热点和难点问题,在文献[1],[2]中,两元行偶的优化和三元行偶的部分优化问题已经解决并给出证明,在文献[3]的基础上进一步给出带两个指定元素及任意个松弛量的三元行偶的优化方法,并给出理论证明.
Paralleled activities to sequential optimization in the picture of CPM network are a difficult problem up to now in network plan analysis. In the document [1], [2], a part of optimization of three-element row couple and two-element row couple proved. Further the optimization of three-element row couple with loose quantities and one designed element is given on the basis document [3]. The optimization of three-element row couple with loose quantities and two designed element is explained in theory.
出处
《数学的实践与认识》
CSCD
北大核心
2005年第6期161-165,共5页
Mathematics in Practice and Theory
基金
高等学校博士点专项基金(20040079008)
华北电力大学青年教师科研基金(20041105)
