UC知道翻译外文的软件
来源：百度知道 编辑：UC知道 时间：2024/06/20 04:51:43
10. Fundamental Scheduling Procedures
10.6 Critical Path Scheduling for Activity-on-Node and with Leads, Lags, and Windows
Performing the critical path scheduling algorithm for activity-on-node representations is only a small variation from the activity-on-branch algorithm presented above. An example of the activity-on-node diagram for a seven activity network is shown in Figure 10-3. Some addition terminology is needed to account for the time delay at a node associated with the task activity. Accordingly, we define: ES(i) as the earliest start time for activity (and node) i, EF(i) is the earliest finish time for activity (and node) i, LS(i) is the latest start and LF(i) is the latest finish time for activity (and node) i. Table 10-7 shows the relevant calculations for the node numbering algorithm, the forward pass and the backward pass calculations.
TABLE 10-7 Critical Path Scheduling Algorithms (Activity-on-Node Representation)
Activity Numbering Algorithm
S
10.6 Critical Path Scheduling for Activity-on-Node and with Leads, Lags, and Windows
Performing the critical path scheduling algorithm for activity-on-node representations is only a small variation from the activity-on-branch algorithm presented above. An example of the activity-on-node diagram for a seven activity network is shown in Figure 10-3. Some addition terminology is needed to account for the time delay at a node associated with the task activity. Accordingly, we define: ES(i) as the earliest start time for activity (and node) i, EF(i) is the earliest finish time for activity (and node) i, LS(i) is the latest start and LF(i) is the latest finish time for activity (and node) i. Table 10-7 shows the relevant calculations for the node numbering algorithm, the forward pass and the backward pass calculations.
TABLE 10-7 Critical Path Scheduling Algorithms (Activity-on-Node Representation)
Activity Numbering Algorithm
S
10. 根本安排做法
10.6临界途径法活动在结的和与主角、滞后和Windows
Performing活动在结表示法的临界途径法算法是从被提出的活动在分支算法的仅小变异以上。 活动在结图的例子七活动网络的在表显示10-3。 一些加法术语是需要的占时延在结与任务活动相关。 相应地，我们定义了： ES (i)作为活动(和结的)最早开始时间i， E-F (i)是活动(和结的)最早结束时间i， LS (i)是最新的开始和LF (i)是活动(和结) i.表10-7展示的延期竣工时期结编号算法、向前传球和落后通行证演算的相关的演算。
TABLE 10-7临界途径法算法(活动在结表示法)
Activity编号算法
Step 1 ： 给开始的有效数字0。
Step 2 ： 给下个数字前辈活动的所有数不清的活动
are其中每一已经编号了。 直到所有活动的Repeat第2步被编号。
Forward通行证
Step 1 ： 让E (0) = 0。
Step 2 ： 为j = 1,2,3，…， n (其中n是最后活动)，让
ES (E-F j) =的最大值{(i)}
where最大值被计算在有j作为他们的后继者的所有活动(i)。
Step 3 ： E-F (j) = ES (j) + Dj
Backward通行证
Step 1 ： 让L (n)均等项目的必需的完成时期。
Note ： L (n)必须合计或超出E (n)。
Step 2 ： 为i = n-1， N2，…， 0，让
LF (i) =极小值{LS (j)}
where极小值被计算在有i作为他们的前辈的所有活动(j)。
Step 3 ： LS (i) = LF (i) -二