The diagram below shows an activity network of a project, in which the duration
ID: 3809011 • Letter: T
Question
The diagram below shows an activity network of a project, in which the duration is in days. Use the Critical Path Scheduling Algorithm to find a schedule for three workers. How many days does the project take to complete by your schedule? days Does this produce an optimum schedule? ('Y' for 'yes'. 'N' for 'No.') Use the Critical Path Scheduling Algorithm to find a schedule for two workers. How many days does the project take to complete by your schedule? days Does this produce an optimum schedule? ('Y' for 'yes'. 'N' for 'No.')Explanation / Answer
1)
There are many path to complete the activity like
start - A-D-F-K-Finish will take (0+1+3+2+2)= 8 days
start-B-F-K-Finish will take (3+2+2)= 7 days
start c-e-g -H-K-Finish = 0+1+4+2+1+2 =10 days
start-c-E-G-J-finish = 1+4+2+1 = 8 days
2)
YES it will produce an optimal solution
example
START - B - F - K - Finish = 3+2+2 = 7 days
this is optimal solution
3)
CRitical path is the longest path to complete
start C-E-G -H-K-Finish = 0+1+4+2+1+2 =10 days
4)
It is not optimal path