Network computations

Various scheduling computations can be established from the network once the duration for
each activity has been noted on the network.

The forward pass computation

The purpose of the forward pass is to establish the earliest starting and finishing times in the
project.

The following rules apply when using the forward pass.

1. The earliest time of occurrence of the initial node is taken as zero.

2. Each activity begins as soon as its preceding node occurs.

3. The earliest finishing time for an activity is equal to the earliest starting time for the activity
plus the duration for the activity in question.

4. The earliest time of occurrence of an event is the latest of the earliest finishing times of the
activities merging at the node in question.

5. These times are noted in the left-hand space in the node

Calculating earliest starts and finishes (ES, EF)

The earliest start time of an activity is established by adding the previous activity’s duration to
the earliest finishing time noted in the previous node, calculating from left to right across the
network.

Where two or more activities meet at a common node, the greatest time (the highest number)
represents the earliest start time for the next activity.

The backward pass computation

The backward pass begins with the planned project completion date and works backwards to
determine the latest date (or day) on which each activity can begin or terminate without
affecting the final completion date of the project.

The following rules apply when using the backward pass.

1. The latest allowable time of occurrence of the terminal of the network is set equal to the
earliest time of occurrence computed in the forward pass.

2. The latest allowable starting time for an activity is the latest allowable time of occurrence for
the succeeding event, minus the duration of the activity in question.

3. The latest allowable time for the occurrence of a node is the earliest of the latest allowable
starting times of activities diverging from the event in question.

Calculating latest starts and finishes (LS, LF)

The latest start time is calculated by subtracting the duration from the latest finishing time
noted in the head node of the activity concerned. Start from the terminal node and calculate
from right to left.

Here is the general rule to be used where multiple activities are involved.

On the forward pass, the highest figure is the one used in the appropriate node.

On the backward pass, the lowest figure is the one used in the node.

Determination of floats and slack times

Total float – The amount of time by which the completion of an activity could be delayed
beyond the earliest expected completion time without affecting the overall project duration
time.
Mathematically

(Tf)ij= (Latest start – Earliest start) for activity ( i – j) = (Tf)ij = (Ls)ij - (Es)ij

or Total float = latest finish time – (earliest start time + duration)

2. Free float

This is the amount of time an activity may be delayed without affecting the earliest starting
time of the activity immediately following.

Mathematically,

(Ff)ij = (Earliest time for event j – Earliest time for event i) – Activity time for ( i,j)

Free float = earliest finish time – (earliest start time + duration)

This is the amount of time an activity may be delayed without affecting preceding or succeeding
activities.

3. Independent float

This is the amount of time an activity may be delayed without affecting preceding or succeeding
activities.

Mathematically

(If)ij = (Ej - Li) - Dij

The negative independent float is always taken as zero.

An activity which contains no float is critical.

Event slack - It is defined as the difference between the latest event and earliest event times.

Mathematically

Head event slack = Lj– Ej, Tail event slack = Li - Ei

Critical event – The events with zero slack times are called critical events. In other words
the event i is said to be critical if Ei = Li

Final thought

There is no set pattern for the positioning of activities and nodes – provided the planning logic
is feasible, the durations allocated are realistic and the position of nodes is not congested. The
actual layout of the network is the responsibility of the designer. It is preferable to have only
one activity connecting the final node.

The completed simple network diagram in Figure 8.26 combines the principles discussed in this
chapter for establishing the critical path (CP) through a network. It also illustrates the inclusion,
in the appropriate positions in the nodes, of the early starts/early finishes and late starts/late
finishes calculated using the forward pass and backward pass techniques.
Practice exercise 1

Find the critical path for this project network.

Solution

forward and backward pass calculations to be done in class with students

Practice 2
a. Identify the critical path.

b. How long will it take to complete this project?

c. Can activity D be delayed without delaying the entire project? How about activity C? If so, how many
weeks?

d. What is the schedule for activity E?

practice 3

Draw the arrow diagram and determine the duration of the project.

3.3 Project Evaluation and Review Technique (PERT)

The main objective in the analysis through PERT is to find out the completion for a
particular event within specified date. The PERT approach takes into account the
uncertainties. The three time values are associated with each activity

1. Optimistic time – It is the shortest possible time in which the activity can be finished.
It assumes that everything goes very well. This is denoted by t0

2. Most likely time – It is the estimate of the normal time the activity would take. This assumes
normal delays. If a graph is plotted in the time of completion and the frequency of completion
in that time period, then most likely time will represent the highest frequency of
occurrence. This is denoted by tm.

3. Pessimistic time – It represents the longest time the activity could take if everything
goes wrong. As in optimistic estimate, this value may be such that only one in hundred or
one in twenty will take time longer than this value. This is denoted by t p

In PERT calculation, all values are used to obtain the percent expected value.
1. Expected time – It is the average time an activity will take if it were to be repeated
on large number of times and is based on the assumption that the activity time follows Beta
distribution, this is given by

2. The variance for the activity is given by

Worked Examples

Example 1: For the project

Find the earliest and latest expected time to each event and also critical path in the network.

Solution
The network is