Consider the network described in the table below. Activity Immediate Predecessor(s) Pessimistic Most likely Optimistic J --
Fantastic news! We've Found the answer you've been seeking!
Question:
Activity | Immediate Predecessor(s) | Pessimistic | Most likely | Optimistic |
J | -- | 15 | 10 | 8 |
K | -- | 9 | 8 | 7 |
L | J | 10 | 6 | 5 |
M | J | 3 | 3 | 3 |
N | K, M | 9 | 5 | 1 |
O | K, M | 10 | 7 | 4 |
P | L, N | 10 | 8 | 3 |
(a) Calculate the expected duration and standard deviation of each activity.
(b) List all the paths from start to finish.
(c) Calculate the expected duration and variance of each path.
(d) Find the probability that the project will be completed in fewer than 30 time units.
Related Book For
Computer Networking A Top-Down Approach
ISBN: 978-0136079675
5th edition
Authors: James F. Kurose, Keith W. Ross
Posted Date: