摘要
本文在文献［１］的基础上引入了松驰量的概念，解决了在ＣＰＭ网络图中，在Ｎ＞２个平行工序中，预先指定一个工序的前提下，在剩下的Ｎ－１个工序中，选择一个工序与指定工序形成一个序偶的最优化问题，并举例说明了它的应用及该方法的优点。
Based on paper< 1 >, the conception of loose quantum is introduced into thispaper. Among n(>2) parallel proedures in CPM network, designate a procedure in advancethere could be (n- 1) procedures. In these procedures, select one, together with the procedure designated beforehand, to form a procedure pair, then, the optimization of this procedure pairis solved. Furthermore, examples are given to illustrate the applications of the method and itsadvantages.
关键词
CPM网络
时间优化
广义序偶
optimization methods
procedure pairs
generalization
