Project Management: Network Diagrams

Gaither/Frazier 9th ed.
Supplemental Problems Chapter 10
CHAPTER 10
Project Management
Network Diagrams
10.1 A project has the following activities and precedence relationships:
══════════════════════════════════════════════════════════
IMMEDIATE IMMEDIATE
PREDECESSOR PREDECESSOR
ACTIVITY ACTIVITIES ACTIVITY ACTIVITIES
──────────────────────────────────────────────────────────
a -- e a
b -- f e,c
c b g c,d,e
d b h f,g
══════════════════════════════════════════════════════════
Construct a CPM network for the project.
Solution
2 e
a 4 f
h
1 6 7
c
b
g
3 5
d
1
Gaither/Frazier 9th ed. Supplemental Problems Chapter 10
10.2 A project has the following activities and precedence relationships:
════════════════════════════════════════════════════════════
IMMEDIATE IMMEDIATE
PREDECESSOR PREDECESSOR
ACTIVITY ACTIVITIES ACTIVITY ACTIVITIES
════════════════════════════════════════════════════════════
a -- h a
b -- i h
c -- j i
d b k b
e c l h,k,f,g
f c m g,f
g d,e
════════════════════════════════════════════════════════════
Construct a CPM network for the project.
Solution
h i
2 5 7
j
a
b k l
1 3 8 10
d
c 6
g m
e
4 9
f
2
Critical Path
10.3 A project has these activities, precedence relationships, and activity durations:
══════════════════════════════════════════════════════════════════════════
Intermediate Activity Intermediate Activity
Predecessor Duration Predecessor Duration
Activity Activities (Weeks) Activity Activities (Weeks)
──────────────────────────────────────────────────────────────────────────
a - 3 e b 5
b - 4 f a 7
c - 3 g e,f 3
d c 12
══════════════════════════════════════════════════════════════════════════
a. Draw a CPM network for the project.

b. Provide an overview for the project by computing the duration for each
path.
c. What is the critical path? What is the project's estimated duration?
Solution
a.
2
d
a
6
b
1 3
e
g
c 5
f
4
b.
═══════════════════════════════════════════════════════
PATH LENGTH OF PATH (weeks)
───────────────────────────────────────────────────────
c-d 3 + 12 = 15 ******
b-e-g 4 + 5 + 3 = 12
a-f-g 3 + 7 + 3 = 13
═══════════════════════════════════════════════════════
c. Path c-d is the critical path, which requires 15 weeks.
3
═════════════════════════════════════════════════════════════════════════════
Intermediate Activity Intermediate Activity
Activity Activities (Days) Activity Activities (Days)
─────────────────────────────────────────────────────────────────────────────
a - 10 f b 17
b - 15 g b 12
c a 10 h d,f 9
d a 20 i h,g 7
e c 15
═════════════════════════════════════════════════════════════════════════════

path.
c. What is the critical path? What is the project's estimated duration?
Solution
a.
2 5
c
d e
a 4
1 h i 7
b 6
f
g
b.
═══════════════════════════════════════════════════════
PATH LENGTH OF PATH (days)
───────────────────────────────────────────────────────
a-c-e 10 + 10 + 15 = 35
a-d-h-i 10 + 20 + 9 + 7 = 46
b-f-h-i 15 + 17 + 9 + 7 = 48 *****
b-g-i 15 + 12 + 7 = 34
═══════════════════════════════════════════════════════
c. Path b-f-h-i is the critical path, which requires 48 days.
4
Immediate Activity Immediate Activity

Activity Activities (days) Activity Activities (days)
a — 6 f a 15
b — 8 g a 17
c — 5 h f 9
d b 13 i g 6
e c 9 j d,e 12

path.
c. What is the critical path? What is the project’s estimated duration?
Solution
f=15
2 5
h=9
g=17
a=6
i=6
6
8
b=8
1 3
d=13
j=12
c=5 7
e=9
4
b.
═══════════════════════════════════════════════════════
───────────────────────────────────────────────────────
a-f-h 6 + 15 + 9 = 30
a-g-i 6 + 17 + 6 = 29
b-d-j 8 + 13 + 12 = 33 <=====
c-e-j 5 + 9 + 12 = 26
═══════════════════════════════════════════════════════
c. Path b-d-j is the critical path, which requires 33 days.
5

Activity Activities (days) Activity Activities (days)
a — 7 e b 19
b — 10 f a 21
c a 14 g c,d 14
d b 12 h f,g,e 8

path.
c. What is the critical path? What is the project’s estimated duration?
Solution
c f
1 4 6 7
b g h
d
e
b.
═══════════════════════════════════════════════════════
───────────────────────────────────────────────────────
a-f-h 7 + 21 + 8 = 36
a-c-g-h 7 + 14 + 14 + 8 = 43
b-e-h 10 + 19 + 8 = 37
b-d-g-h 10 + 12 + 14 + 8 = 44 <=====
═══════════════════════════════════════════════════════
c. Path b-d-g-h is the critical path, which requires 44 days.
6
Slack Times
10.7 Using the information in Problem 10.4:

b. Compute the EF, LF, and slack for each activity. Write the values on
the CPM network.
c. What is the critical path and its duration?
Solution

the CPM network.
S 13
EF LF 20 33
2 5
c=10
13
2 35 48
2 d=20
10 12
30 32 e=15
0
a=10
41 41
4
0
1 h=9 i=7 7
b=15 32 32 6
f=17 0
02 g=12 48 48
10
15 12
15 14
3 27 41
Path b-f-h-i is the critical path, its duration is 48 days.
7
10.8 Using the information in Problem 10.6:

the CPM network.
Solution

the CPM network.
S
2
8 EF LF
1 28 36
7 8 1 c=14 f=21
a=7 21 22
0 0
36 36 44 44
1 4 6 7
g=14 h=8
0
b=10 22 22 d=12
e=19
0
7
10 10
29 36
Path b-d-g-h is the critical path, which requires 44 days.
8
════════════════════════════════════════════════════════════════════════════
Activity Activities (Weeks) Activity Activities (Weeks)
────────────────────────────────────────────────────────────────────────────
a -- 3 g d 10
b -- 9 h e,f 7
c -- 7 i g,h 14
d a 12 j c 15
e a,b 10 k f,j 9
f c 11
════════════════════════════════════════════════════════════════════════════
a. Construct a CPM network for the project.

b. Compute the EF, LF, and slack for each activity. Write the values on the CPM
network.
c. Compute the ES and LS for all activities. Display the ES, EF, LS, LF, and
slack values in a table.
d. What is the critical path and its duration?
Solution
a. Construct a CPM network for the project.

b. Compute the EF, LF, and slack for each activity. Write the values on the CPM
network.
S
1 1
EF LF
15 16 25 26
2 5 8
d=12 g=10
1 0
3 4 40 40
0
h=7 26 26 i=14
a=3 0 0
9 9 19 19
1 3 7 10
b=9 e=10
c=7 1 6 k=9
1 18 19 9
7 8 f=11
31 40
4 9
j=15 9
22 31
9
10.9 Continued
c. Compute the ES and LS for all activities. Display the ES, EF, LS, LF, and
═══════════════════════════════════════════════════════════════════════════
ACTIVITY EARLIEST EARLIEST LATEST LATEST
ACTIVITY DURATION START FINISH START FINISH SLACK
────────────────────────────────────────────────────────────────────────────
a 3.00 0.00 3.00 1.00 4.00 1.00
b 9.00 0.00 9.00 0.00 9.00 0.00
c 7.00 0.00 7.00 1.00 8.00 1.00
d 12.00 3.00 15.00 4.00 16.00 1.00
e 10.00 9.00 19.00 9.00 19.00 0.00
f 11.00 7.00 18.00 8.00 19.00 1.00
g 10.00 15.00 25.00 16.00 26.00 1.00
h 7.00 19.00 26.00 19.00 26.00 0.00
i 14.00 26.00 40.00 26.00 40.00 0.00
j 15.00 7.00 22.00 16.00 31.00 9.00
k 9.00 22.00 31.00 31.00 40.00 9.00
════════════════════════════════════════════════════════════════════════════
Note: ES = EF - D and LS = LF - D.
d. What is the critical path and its duration?
The critical path is b-e-h-i, its duration is 40 weeks.
10
PERT
10.10 An activity in a project has three time estimates: optimistic time (t o) = 15 weeks,
most likely time (tm) = 20 weeks, and pessimistic time (tp) = 22 weeks.
a. Compute the activity's expected time or duration (t e).

b. Compute the activity's variance (Vt).
c. Compute the activity's standard deviation (t).
Solution
a. Compute the activity's expected time or duration (t e).
te = (to + 4tm + tp)/6
= [15 + 4(20) + 22]/6 = 19.50 weeks
Vt = [(tp - to)/6]2 = [(22 - 15)/6]2 = 1.361
σ t =  V t =  1. 361 = 1.17 weeks
11
10.11 Project path a-c-e-f has these activity time estimates in days:
═══════════════════════════════════════════════
Optimistic Most Likely Pessimistic
Activity Time (to) Time (tm) Time (tp)
───────────────────────────────────────────────
a 20 25 30
c 25 30 32
e 15 17 20
f 18 18 18
═══════════════════════════════════════════════
a. Compute the expected time or duration (t e) for each activity.

b. Compute the variance (Vt) for each activity.
c. Compute the expected duration and variance for the path.
Solution
a. Compute the expected time or duration (t e) for each activity.
te = (to + 4tm + tp)/6
Activity a: te = [20 + 4(25) + 30]/6 = 25 days

Activity c: te = [25 + 4(30) + 32]/6 = 29.5 days
Activity e: te = [15 + 4(17) + 20]/6 = 17.17 days
Activity f: te = [18 + 4(18) + 18]/6 = 18 days
b. Compute the variance (Vt) for each activity.
Vt = [(tp - to)/6]2
Activity a: Vt = [(30 - 20)/6]2 = 2.78

Activity c: Vt = [(32 - 25)/6]2 = 1.36
Activity e: Vt = [(20 - 15)/6]2 = .69
Activity f: Vt = [(18 - 18)/6]2 = 0
te = 25 + 29.5 + 17.17 + 18 = 89.67 days
Vt = 2.78 + 1.36 + .69 + 0 = 4.83
12
10.12 An activity in a PERT network has these estimates: t o = 10, tm = 12, tp = 15.
a. Compute the activity's expected time (t e).

Solution
a. Compute the activity's expected time (t e).
te = (to + 4tm + tp)/6
= [10 + 4(12) + 15]/6 = 12.17
Vt = [(tp - to)/6]2 = [(15 - 10)/6]2 = .694
σ t =  V t =  . 694 = .83
13
10.13 A path in a PERT network has these activity time estimates in days:
════════════════════════════════════════════════════════
Activity Time(to) Time (tm) Time (tp)
────────────────────────────────────────────────────────
a 10 12 15
c 10 15 20
f 10 12 13
i 10 15 20
════════════════════════════════════════════════════════
Compute the mean path duration and the path variance.
Solution
═════════════════════════════════════════════════════════════════
MOST ACTIVITY
OPTIMISTIC LIKELY PESSIMISTIC EXPECTED ACTIVITY
TIME TIME TIME TIME VARIANCE
ACTIVITY (to) (tm) (tp) (te) (Vt)
─────────────────────────────────────────────────────────────────
a 10 12 15 12.17 .694
c 10 15 20 15.00 2.778
f 10 12 13 11.83 .250
i 10 15 20 15.00 2.778
─────────────────────────────────────────────────────────────────
PATH MEAN DURATION AND VARIANCE 54.00 6.500
═════════════════════════════════════════════════════════════════
14
10.14 Two paths of a PERT network have these mean durations and variances in days:
═══════════════════════════════════════
Mean Duration Variance
Path (Ste) (SVt)
───────────────────────────────────────
1 45 2.75
2 44 5.50
3 46 1.20
═══════════════════════════════════════
Which path offers the greater risk of taking longer than 55 days?
Solution
First, compute the standard deviations for the paths:
σ t= ∑ V t
Path 1: σ t =  2 .80 = 1.673 days
Path 2: σ t =  4 . 94 = 2.223 days
Next, compute the number of standard deviations from the mean to 55 days for each
path:
Z = (x - )/t
Z1 = (55 - 53.5)/1.673 = .90
Z2 = (55 - 52.5)/2.223 = 1.12
Next, use Appendix A to compute the probability of overrunning 55 weeks for each of
the paths:
Path 1: P(D > 55) = 1 - .81594 = .18406 or about 18.4 percent
Path 2: P(D > 55) = 1 - .86864 = .13136 or about 13.1 percent
Path 1 offers the greatest risk of exceeding 55 days.
15
10.15 An activity in a project has three time estimates: optimistic time (t o) = 16 days,
most likely time (tm) = 19 days, and pessimistic time (tp) = 21 days.
a. Compute the activity’s expected time or duration (t e).

b. Compute the activity’s variance (Vt).
c. Compute the activity’s standard deviation (t).
Solution
a. Compute the activity’s expected time or duration (t e).
te = (to + 4tm + tp)/6
= [16 + 4(19) + 21]/6 = 18.83 days
Vt = [(tp - to)/6]2 = [(21 - 16/6]2 = .694
c. Compute the activity’s standard deviation (t).
σ t =  V t =  . 694=. 833 days
16
10.16 An activity in a PERT network has these estimates: t o = 15, tm = 17, tp = 20.
a. Compute the activity’s expected time (te).

Solution
a. Compute the activity’s expected time (te).
te = (to + 4tm + tp)/6
= [15 + 4(17) + 20]/6 = 17.17
Vt = [(tp - to)/6]2 = [(20 - 15)/6]2 = .694
σ t =  V t =  . 694=. 833 days
17
10.17 Project path b–c–g–j has these activity time estimates in days:

Activity Time (to) Time (tm) Time (tp)
─────────────────────────────────────
b 6 7 8
c 14 16 19
g 9 13 16
j 8 8 8
a. Compute the expected time or duration (t e ) for each activity.

b. Compute the variance (Vt ) for each activity.
Solution
a. Compute the expected time or duration (t e ) for each activity.
te = (to + 4tm + tp)/6
Activity b: te = [ 6 + 4(7) + 8]/6 = 7 days
Activity c: te = [14 + 4(16) + 19]/6 = 16.17 days
Activity g: te = [ 9 + 4(13) + 16]/6 = 12.83 days
Activity j: te = [ 8 + 4(8) + 8]/6 = 8 days
b. Compute the variance (Vt ) for each activity.
Vt = [(tp - to)/6]2
Activity b: Vt = [( 8 - 6)/6]2 = .111
Activity c: Vt = [(19 - 14)/6]2 = .694
Activity g: Vt = [(16 - 9)/6]2 = 1.361
Activity j: Vt = [( 8 - 8)/6]2 = 0
te = 7 + 16.17 + 12.83 + 8 = 89.67 days
Vt = .111 + .694 + 1.361 + 0 = 2.166 days
18
10.18 A project has the following activities, precedence relationships, and time
estimates in days:
Immediate
Predecessor Optimistic Most likely Pessimistic
Activity Activities Time (to) Time (tm) Time (tp)
───────────────────────────────────────────────
a — 12 13 14
b a 6 9 11
c a 9 11 13
d b 14 16 17
e c 5 5 5
f c 5 7 8
g c 8 12 14
h d,e 13 15 17
i g 7 9 11
j h,f,i 14 16 17
a. Compute the duration (expected time) and variances for each activity.
b. Draw a PERT network.
c. Compute the EF, LF, and slack for each activity. Write the values on the
PERT network.
d. Compute the ES and LS for all activities. Display the ES, EF, LF, and
e. What is the critical path?
f. What is the probability that the project will take longer than 70 days?
Solution
a. Compute the duration (expected time) and variances for each activity.
═════════════════════════════════════════════════════════════════
MOST ACTIVITY
OPTIMISTIC LIKELY PESSIMISTIC EXPECTED ACTIVITY
TIME TIME TIME TIME VARIANCE
ACTIVITY (to) (tm) (tp) (te) (Vt)
─────────────────────────────────────────────────────────────────
a 12 13 14 13.00 .11
b 6 9 11 8.83 .69
c 9 11 13 11.00 .44
d 14 16 17 15.83 .25
e 5 5 5 5.00 0
f 5 7 8 6.83 .25
g 8 12 14 11.67 1.00
h 13 15 17 15.00 .44
i 7 9 11 9.00 .44
j 14 16 17 15.83 .25
═════════════════════════════════════════════════════════════════
19
10.18 Continued
b. Draw a PERT network.

c. Compute the EF, LF, and slack for each activity. Write the values on the
PERT network.
0 S
37.67 37.67 EF LF
2
d=15.83
0
21.83 21.83
2 0
b=8.83 8.67
52.67 52.67
29.00 37.67
h=15.00
0 e=5.00 21.83 0
13.00 13.00 30.83 52.67 68.50 68.50
1 2 4 7 8
a=13.00 c=11.00 f=6.83 j=15.83
8.00
24.00 32.00 g=11.67 i=9.00
8.00 8.00
35.67 43.67 44.67 52.67
3
20
10.18 Continued
d. Compute the ES and LS for all activities. Display the ES, EF, LF, and
Below is the computer printout from the POM Software Library.
*** PROJECT EVALUATION AND REVIEW TECHNIQUE ***
PROJECT CRITICAL TIME: 68.50

CUSTOMER REQUIRED TIME: 70.00
ACTIVITY EARLIEST EARLIEST LATEST LATEST SLACK

START FINISH START FINISH
a 0.00 13.00 0.00 13.00 0.00

b 13.00 21.83 13.00 21.83 0.00
c 13.00 24.00 21.00 32.00 8.00
d 21.83 37.67 21.83 37.67 0.00
e 24.00 29.00 32.67 37.67 8.67
f 24.00 30.83 45.83 52.67 21.83
g 24.00 35.67 32.00 43.67 8.00
h 37.67 52.67 37.67 52.67 0.00
i 35.67 44.67 43.67 52.67 8.00
j 52.67 68.50 52.67 68.50 0.00
** PROJECT CRITICAL PATH(S) **
a b d h j
DURATION: 68.50
VARIANCE: 1.75
STANDARD DEVIATION: 1.32
NUMBER OF STANDARD DEVIATIONS OFF REQUIRED TIME: 1.13
e. What is the critical path?
The critical path is a-b-d-h-j, its duration is 68.5 days.
f. What is the probability that the project will take longer than 70 days?
From the computer solution above, t = 1.32 days and 70 days is 1.13
standard deviations from the mean. From Appendix A we obtain the
probability that completion time will be less than 70 days is .87076, therefore,
the probability that the completion time will be greater than 70 days is:
P(D > 70) = 1 - .87076 = .12924 or about 13 percent
21

Project Management: Network Diagrams

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Project Management: Network Diagrams

Uploaded by

Copyright:

Available Formats

Gaither/Frazier 9th ed.

Supplemental Problems Chapter 10

10.1 A project has the following activities and precedence relationships:

Construct a CPM network for the project.

10.2 A project has the following activities and precedence relationships:

Construct a CPM network for the project.

a. Draw a CPM network for the project.

c. Path c-d is the critical path, which requires 15 weeks.

a. Draw a CPM network for the project.

c. Path b-f-h-i is the critical path, which requires 48 days.

Immediate Activity Immediate Activity

a. Draw a CPM network for the project.

a. Draw a CPM network for the project.

c. Path b-d-j is the critical path, which requires 33 days.

Immediate Activity Immediate Activity

a. Draw a CPM network for the project.

a. Draw a CPM network for the project.

c. Path b-d-g-h is the critical path, which requires 44 days.

10.7 Using the information in Problem 10.4:

a. Draw a CPM network for the project.

a. Draw a CPM network for the project.

c. What is the critical path and its duration?

Path b-f-h-i is the critical path, its duration is 48 days.

10.8 Using the information in Problem 10.6:

a. Draw a CPM network for the project.

a. Draw a CPM network for the project.

c. What is the critical path and its duration?

Path b-d-g-h is the critical path, which requires 44 days.

a. Construct a CPM network for the project.

a. Construct a CPM network for the project.

d. What is the critical path and its duration?

The critical path is b-e-h-i, its duration is 40 weeks.

a. Compute the activity's expected time or duration (t e).

a. Compute the activity's expected time or duration (t e).

te = (to + 4tm + tp)/6

= [15 + 4(20) + 22]/6 = 19.50 weeks

b. Compute the activity's variance (Vt).

Vt = [(tp - to)/6]2 = [(22 - 15)/6]2 = 1.361

c. Compute the activity's standard deviation (t).

σ t =  V t =  1. 361 = 1.17 weeks

a. Compute the expected time or duration (t e) for each activity.

a. Compute the expected time or duration (t e) for each activity.

te = (to + 4tm + tp)/6

Activity a: te = [20 + 4(25) + 30]/6 = 25 days

b. Compute the variance (Vt) for each activity.

Activity a: Vt = [(30 - 20)/6]2 = 2.78

c. Compute the expected duration and variance for the path.

te = 25 + 29.5 + 17.17 + 18 = 89.67 days

Vt = 2.78 + 1.36 + .69 + 0 = 4.83

a. Compute the activity's expected time (t e).

a. Compute the activity's expected time (t e).

te = (to + 4tm + tp)/6

= [10 + 4(12) + 15]/6 = 12.17

b. Compute the activity's variance (Vt).

Vt = [(tp - to)/6]2 = [(15 - 10)/6]2 = .694

c. Compute the activity's standard deviation (t).

Compute the mean path duration and the path variance.

First, compute the standard deviations for the paths:

Path 2: σ t =  4 . 94 = 2.223 days

Z1 = (55 - 53.5)/1.673 = .90

Z2 = (55 - 52.5)/2.223 = 1.12

Path 1: P(D > 55) = 1 - .81594 = .18406 or about 18.4 percent

Path 2: P(D > 55) = 1 - .86864 = .13136 or about 13.1 percent

* PROJECT EVALUATION AND REVIEW TECHNIQUE *

PROJECT CRITICAL PATH(S)