摘要
平行序链的顺序优化问题一直是目前网络计划优化理论研究的焦点问题之一.从网络本身的规律性出发,对具有很大推广价值的四个平行序链的顺序优化问题进行研究,利用路长定理计算序链调整过程中新增路线的路长,并给出了可靠、有效的删减路长计算的方法,在此基础上,设计出了该问题的优化算法.实例表明,该算法简单易行,便于应用.
The sequencing optimal decision of parallel procedure chains is one of the focuses of the theory of project planning and control at present. The paper study sequencing optimal arithmetic of four parallel procedure chains which has great generalize value according to the rule of network it- self. Based on the path length theory, the paper find out all the new paths, and present a reliable and efficient method to reduce calculation for the length of paths. Furthermore, a new arithmetic is provided in view of activity floats. It is feasible and easy to use through example.
出处
《系统工程学报》
CSCD
北大核心
2008年第4期455-461,共7页
Journal of Systems Engineering
基金
国家自然科学基金资助项目(70671040)
教育部博士点基金资助项目(20050079008)
关键词
平行序链
机动时间
优化决策
parallel procedure chain
activity float
optimal decision
