Transcript Document 7592685

Network exercise (P2)
Consider the PERT/CPM network shown below.
2
A
D
3
E
1
F
B
G
4
6
J
7
H
C
I
5
a. Add the dummy activities that will eliminate the problem of
activities having the same starting and ending nodes.
1
Network exercise (P2)
b. Add dummy activities that will satisfy the following
immediate predecessor requirements:
Activity
H
I
G
Immediate
Predecessor
B, C
B, C
D, E
2
Network exercise with time (P4)
Construct a PERT/CPM network for a project with the
following activities and times:
Activity
A
B
C
D
E
F
G
Immediate
Predecessor
A
A
C, B
C, B
D, E
Time
(months)
4
6
2
6
3
3
5
a) Find the critical path for this project network.
b) This project must be complete in 1 1/2 years; do you
anticipate difficulty in meeting the deadline? Explain.
3
Consider the following network (P6)
(times are in weeks)
C
7
2
A
5
F
3
D
6
1
B
3
5
4
3
E
7
H
8
G
10
6
a. Identify the critical path.
b. How long will it take to complete this project?
c. Can activity D be delayed without delaying the entire project?
How about activity C? If so, how many weeks?
d. What is the schedule for activity E?
4
Network exercise with time (P7)
A project involving the installation of a computer system consists
of eight activities. The immediate predecessor and activity time in
weeks are shown below:
Activity
Immediate
Time
Predecessor
(weeks)
A
3
B
6
C
A
2
D
B,C
5
E
D
4
F
E
3
G
B,C
9
H
F,G
3
a. Draw the PERT/CPM network for this project.
b. What are the critical path activities?
c. What is the expected project completion time?
5