摘要
文献[1]的基础上,引入了松弛变量的概念.在确定性的CPM网络中,研究了预先没有指定工序的四个平行工序中,从中选择三个调整为顺序工序的问题,并给出了确定最优三元序链的方法.此外,用事例证明了该种方法的可行性与实用性.
Based on bibliography , the conception of relax quantum is introduced into this paper Among 4 parallel activities in CPM network, without designating activities in advance, select three parallel activities to form an activity chain The optimization of this activity chain is solved Furthermore, examples are given to illustrate the applications of the method and its advantages
出处
《河南教育学院学报（自然科学版）》
2005年第1期6-8,共3页
Journal of Henan Institute of Education(Natural Science Edition)
关键词
松弛变量
优化方法
三元序链
亏值
relax quantum
optimization methods
three parallel activity chain
tardiness
