Calculating Slack Time and Identifying The Critical Path
Calculating Slack Time and Identifying The Critical Path
After we have computed the earliest and latest times for all activities, it is a simple matter to
find the amount of slack time that each activity has. Slack is the length of time an activity
can be delayed without delaying the entire project. Mathematically:
Slack time= Free time for an activity. Also referred to as free float or free slack.
Slack = LS − ES or Slack = LF – EF
The activities with zero slack are called critical activities and are said to be on the critical
path.
The critical path is a continuous path through the project network that:
◆ Starts at the first activity in the project (Start in our example).
◆ Terminates at the last activity in the project (H in our example).
◆ Includes only critical activities (i.e., activities with no slack time).
Total Slack Time
Look again at the project network in Overlay 3 of Figure 3.10 . Consider activities B and D,
which have slack of 1 week each. Does it mean that we can delay each activity by 1 week,
and still complete the project in 15 weeks? The answer is no.
Let’s assume that activity B is delayed by 1 week. It has used up its slack of 1 week and now
has an EF of 4. This implies that activity D now has an ES of 4 and an EF of 8. Note that these
are also its LS and LF values, respectively. That is, activity D also has no slack time now.
Essentially, the slack of 1 week that activities B and D had is, for that path, shared between
them. Delaying either activity by 1 week causes not only that activity, but also the other
activity, to lose its slack. This type of a slack time is referred to as total slack . Typically,
when two or more noncritical activities appear successively in a path, they share total slack.
Pessimistic time ( b ) = time an activity will take assuming very unfavorable conditions. In estimating
this value, there should also be only a small probability (also 1/100) that the activity time will be > b .
Most likely time ( m ) = most realistic estimate of the time required to complete an activity.
When using PERT, we often assume that activity time estimates follow the beta probability
distribution (see Figure 3.11 ). This continuous distribution is often appropriate for determining the
expected value and variance for activity completion times.
Optimistic time = The “best” activity completion time that could be obtained in a PERT
network
Pessimistic time = The “worst” activity time that could be expected in a PERT network.
Most likely time = The most probable time to complete an activity in a PERT network.
When using PERT, we often assume that activity time estimates follow the beta probability
distribution (see Figure 3.11 ). This continuous distribution is often appropriate for
determining the expected value and variance for activity completion times.
To find the expected activity time , t , the beta distribution weights the three time estimates as
follows:
t=(a+4m+b)∕6
That is, the most likely time ( m ) is given four times the weight as the optimistic time ( a )
and pessimistic time ( b ). The time estimate t computed using Equation (3-6) for each
activity is used in the project network to compute all earliest and latest times.
To compute the dispersion or variance of activity completion time , we use the formula
Variance = [( b − a ) ∕ 6]