https://d2vlcm61l7u1fs.cloudfront.net/media%2F614%2F614c4f10-03ee-4019-a7bf-3970131a209a%2FphpJyVVRQ.png
Computation of earliest starting and finishing times is aided by two simple rules:
1. The earliest finish time for any activity is equal to its earliest start time plus its expected
duration, t:
EF = ES + t
2. ES for activities at nodes with one entering arrow is equal to EF of the entering arrow. ES
for activities leaving nodes with multiple entering arrows is equal to the largest EF of the
entering arrow.
Computation of the latest starting and finishing times is aided by the use of two rules:
1. The latest starting time for each activity is equal to its latest finishing time minus its
expected duration:
LS = LF – t
2. For nodes with one leaving arrow, LF for arrows entering that node equals the LS of the
leaving arrow. For nodes with multiple leaving arrows, LF for arrows entering that node
equals the smallest LS of leaving arrows.
Finding ES and EF times involves a forward pass through the network; finding LS and LF
times involves a backward pass through the network. Hence, we must begin with the EF of the
last activity and use that time as the LF for the last activity. Then we obtain the LS for the last
activity by subtracting its expected duration from its LF
Slack = LS-ES = LF-EF
Activities for which Slack = 0 are in critical path
https://d2vlcm61l7u1fs.cloudfront.net/media%2Ff6d%2Ff6da0e14-3ca0-413a-8b5b-edab01230cc2%2Fphp30UzrS.png
If the activity time of D is changed from 2 to 6 days, there will be change in critical path as the slack time is 3 days and increase is by 4 days. The project will take longer time by 1 day to 23 days. So, both critical path and project duration will change
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
