摘要
给出了先序活动和后序活动的基本定义,讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理,提出了基于堆栈机制的标定算法.根据关键路径法和串行调度原理,论述了先序活动和后序活动时间参数计算的方法,并以实例阐述了计算原理.这种方法可以应用到大型工程调度和资源受限的工程调度策略研究中.
A method to mark transitive predecessors and transitive successors by using depth first search is provided with a description of the algorithm based on stack. Transitive predecessors and transitive successors were defined. According to critical path method and serial scheduling, a schema was discussed for computing time parameters of transitive predecessors and transitive successors. And an example is given to show the principle. This can be applied to the research on the rules of large scale projects scheduling and resource-constrained project scheduling.
出处
《华中科技大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2007年第4期26-28,32,共4页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
国家自然科学基金资助项目(70171015)
武汉市科技局晨光计划资助项目(20025001034)
关键词
活动网络
先序活动
后序活动
关键路径法
深度优先搜索
串行调度
activity network
transitive predecessors
transitive successors
critical path method
depth first search
serial scheduling
