USA: +1 (725) 712-1730 
Sign in
ecure https://newconnect.mheducation.com/flow/connect.html Check my work mode : This shows what is correct or incorrect for the work you have completed so far. It does no 2 Problem 4-10 Thefollowing represents a project that should be scheduled using CPM: nts TIMES (DAYS) IMMEDIATE ACTIVITY PREDECESSORS 3 4 11 c, D D, E F, G b. What is the critical path? A-D-G-H K Prev 2 of 2 Next
Expert Answer
The Predecessor Diagram as follows :
| A | B | ||
| C | D | E | |
| F | G | ||
| H | |||
Following table also shows Expected time for each activity.
Expected time for each activity ( E)
= ( a + 4.m + b )/6
| Activity | A ( days) | M ( days ) | B ( days) | Expected time = ( a + 4m + b)/6 |
| A | 1 | 3 | 5 | 3 |
| B | 1 | 2 | 3 | 2 |
| C | 1 | 2 | 3 | 2 |
| D | 2 | 3 | 4 | 3 |
| E | 3 | 4 | 11 | 5 |
| F | 3 | 4 | 5 | 4 |
| G | 1 | 4 | 6 | 3.83 |
| H | 2 | 4 | 5 | 3.83 |
From the above Predecessor diagram, the possible paths and their corresponding cumulative durations as follows :
A-C-F-H = 3 + 2 + 4 + 3.83 days = 12.83 days
A-D-F-H = 3 + 3 + 4 + 3.83 = 13.83 days
A-D-G-H = 3 + 3 + 3.83 + 3.83 = 13.66 days
B-E-G-H = 2 + 5 + 3.83 + 3.83 days = 14.66 days
Since the path B-E-G-H has the longest duration of 14.66 days, it forms the critical path
| CRITICAL PATH = B-E-G-H |
