Question: Activity Immediate Predecessors Time Required (weeks) A Start 3 B Start 4 C A, B 3 D B 5 E C 4 F D, E
|
Activity | Immediate Predecessors | Time Required (weeks) |
| A | Start | 3 |
| B | Start | 4 |
| C | A, B | 3 |
| D | B | 5 |
| E | C | 4 |
| F | D, E | 3 |
For the project described by the above table do the following:
(a) Draw the network diagram
(b) Using Earliest Start / Earliest Finish, and Latest Start / Latest Finish, find the critical path. Clearly indicate the sequence of activities on the critical path and compute the length of the critical path.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
