Problem 1: A network consists of the following list. Times are given in weeks. a
ID: 417590 • Letter: P
Question
Problem 1:
A network consists of the following list. Times are given in weeks.
a. Draw the network diagram.
b. Which activities form the critical path? Use the longest path method and two-pass method to answer this question.
c. How much slack exists at activities A and F?
d. What is the duration of the critical path?
Note: please show your process of getting the results. Only providing the final answers is not acceptable and will get me a 0%. Thank you in advance.
Sincerly a last semester Grad Student
Activity Preceding Duration A -- 8 B A 3 C A 17 D A 5 E B 7 F B 8 G C, F 3 H D 2 I H 8 J G, I 6 K E, J 3Explanation / Answer
The network precedence diagram as follows :
A
B
C
D
E
F
H
G
I
J
K
The possible paths and their corresponding durations as follows :
A-B-E- K = 8 +3 +7 + 3 = 21
A-B-F-G-J-K = 8 +3 + 8 +3 +6 +3 = 31
A-C-G-J-K = 8 +17 +3 +6 +3 = 37
A-D-H-I-J-K = 8 +5+2+8+6+3 = 32
Since A-C-G-J-K has the longest , duration it forms the critical path
ACTIVITIES ON CRITICAL PATH = A-C-G-J-K
DURATION OF CRITICAL PATH = 37
Slack of activities B.F = Duration of A-C-G-J-K - Duration of A-B-F-G-J-K = 37 – 31 = 6 weeks
All activities lying on critical path have ZERO slack. Therefore, Slack for activity A will be ZERO
SLACK OF ACTIVITIES A AND F ARE ZERO AND 6 WEEKS RESPECTIVELY
A
B
C
D
E
F
H
G
I
J
K