Ch07 Solutions

CHAPTER 7
PROJECT MANAGEMENT
SOLUTIONS TO DISCUSSION QUESTIONS
7-1. PERT and CPM can answer a number of questions about a project or the activities within a project.
These techniques can determine the earliest start, earliest finish, latest start, and the latest finish times for
all activities within a network. Furthermore, these techniques can be used to determine the project
completion data for the entire project, the slack for all activities, and those activities that are along the
critical path of the network.
7-2. There are several major differences between PERT and CPM. With PERT, three estimates of activity
time and completion are made. These are the optimistic, most likely, and pessimistic time estimates. From
these estimates, the expected completion time and completion variance can be determined. CPM allows
the use of crashing. This technique allows a manager to reduce the total project completion time by
expending additional resources on activities within the network. CPM is used in determining the leastcost method of crashing a project or network.
7-3. An activity is a task that requires a fixed amount of time and resources to complete. An immediate
predecessor is an activity that must be completely finished before another activity can be started.
7-4. Expected activity times and variances can be computed by making the assumption that activity times
follow a beta distribution. Three time estimates are used to determine the expected activity time and
variance for each activity.
7-5. The critical path consists of those activities that will cause a delay in the entire project if they
themselves are delayed. These critical path activities have zero slack. If they are delayed, the entire
project is delayed. Critical path analysis is a way of determining the activities along the critical path and
the earliest start time, earliest finish time, latest start time, and the latest finish time for every activity. It is
important to identify these activities because if they are delayed, the entire project will be delayed.
7-6. The earliest activity start time is the earliest time that an activity can be started after all predecessor
activities are completely finished. The earliest activity start times are determined using a forward pass
through the project network. The latest activity start time represents the latest time that an activity can be
started without delaying the entire project. Latest activity start times are determined by making a
backward pass through the network.
7-7. Slack is the amount of time that an activity can be delayed without delaying the entire project. If the
slack is zero, the activity cannot be delayed at all without delaying the entire project. For any activity,
slack can be determined by subtracting the earliest start from the latest start time, or by subtracting the
earliest finish from the latest finish time.
7-8. We can determine the probability that a project will be completed by a certain date by knowing the
expected project completion time and variance. The expected project completion time can be determined
by adding the activity times for those activities along the critical path. The total project variance can be
determined by adding the variance of those activities along the critical path. In most cases, we make the
assumption that the project completion times follow a normal distribution. When this is done, we can use
a standard normal table in computing the probability that a project will be completed by a certain date.
7-9. This can be done by making a budget for the entire project using the activity cost estimates and by
monitoring the budget as the project takes place. Using this approach we can determine the extent to
which a project is incurring a cost overrun or a cost underrun. In addition, we can use the same technique
to determine the extent to which a project is ahead of schedule or behind schedule.
7-10. Crashing is the process of reducing the total time it takes to complete a project by expending
additional resources. In performing crashing by hand, it is necessary to identify those activities along the
critical path and then to reduce those activities that cost the least to reduce or crash. This is continued
until the project is crashed to the desired completion date. In doing this, however, two or more critical
paths can develop in the same network.
7-11. Linear programming is very useful in CPM crashing because it is a commonly used technique and
many computer programs exist that can be easily used to crash a network. In addition, there are many
sensitivity and ranging techniques that are available with linear programming.
SOLUTIONS TO PROBLEMS
7-12. See file P7-12.XLS.
(a)
D
E
Start
G
C
(b)
Activity Time
A
2
B
5
C
1
D
10
E
3
F
6
G
8
Critical path =
Project length =
EST EFT
0
2
0
5
0
1
5 15
15 18
1
7
18 26
B-D-E-G
26 days
LST
13
0
11
5
15
12
18
LFT Slack Critical?

15
13
N
5
0
Y
12
11
N
15
0
Y
18
0
Y
18
11
N
26
0
Y

(a)
G
En
d
Start
F
(b)
Activity Time EST EFT
A
3
0
3
B
5
0
5
C
7
3
10
D
5
3
8
E
4
10 14
F
6
5
11
G
2
14 16
H
3
11 14
Critical path =
A-C-E-G
Project length = 16 weeks
LST
0
2
3
9
10
7
14
13
LFT Slack Critical?

3
0
Y
7
2
N
10
0
Y
14
6
N
14
0
Y
13
2
N
16
0
Y
16
2
N

(a)
A
En
d
D
Start
H
E
B
F
(b)
Activity Time EST EFT LST
A
6
0
6
0
B
5
0
5
0
C
3
6
9
6
D
2
6
8
10
E
4
5
9
5
F
6
5
11
6
G
10
9
19
9
H
7
11 18 12
Critical paths = A-C-G & B-E-G
Project length =
19 weeks
LFT Slack Critical?

6
0
Y
5
0
Y
9
0
Y
12
4
N
9
0
Y
12
1
N
19
0
Y
19
1
N

(a)
H
K
C
En
d
E
J
G
(b)
Activity Time EST EFT LST LFT Slack Crit?
A
4
0
4
0
4
0
Y
B
6
4
10
4
10
0
Y
C
12
10
22
10
22
0
Y
D
11
10
21
13
24
3
N
E
9
21
30
25
34
4
N
F
8
21
29
26
34
5
N
G
10
21
31
24
34
3
N
H
5
22
27
24
29
2
N
I
7
22
29
22
29
0
Y
J
4
31
35
34
38
3
N
K
9
29
38
29
38
0
Y
Critical path =
A-B-C-I-K
Project length =
38 days

(a)
B
E
I
En
d
H
(b)
Activity Time
A
5
B
6
C
2
D
9
E
9
F
3
G
7
H
4
I
6
J
5
Critical path =
Project length =
EST EFT LST

0
5
0
5
11
6
5
7
16
5
14
5
11
20
12
14
17
18
14
21
14
14
18
18
21
27
21
18
23
22
A-D-G-I
27 days
LST Slack Crit?

5
0
Y
12
1
N
18
11
N
14
0
Y
21
1
N
21
4
N
21
0
Y
22
4
N
27
0
Y
27
4
N

(a)
F
A
K
Star
t
B
E
End
J
D
(b & c)
Act a
A
3
B
2
C
1
D
6
E
2
F
6
G
1
H
3
I
10
J 14
K
2
m
6
4
2
7
4
10
2
6
11
16
8
b
8
4
3
8
6
14
4
9
12
20
10
Exp t
5.83
3.67
2.00
7.00
4.00
10.00
2.17
6.00
11.00
16.33
7.33
Var
0.69
0.11
0.11
0.11
0.44
1.78
0.25
1.00
0.11
1.00
1.78
SD
0.83
0.33
0.33
0.33
0.67
1.33
0.50
1.00
0.33
1.00
1.33
EST
0.00
0.00
0.00
2.00
9.00
13.00
13.00
23.00
15.17
15.17
29.00
Critical path =
Project length =
Project variance =
Project std deviation =
(d) P(Finish <= 40 days) = 0.9457
EFT
5.83
3.67
2.00
9.00
13.00
23.00
15.17
29.00
26.17
31.50
36.33
LST
7.17
5.33
0.00
2.00
9.00
13.00
15.83
23.00
18.00
20.00
29.00
C-D-E-F-H-K
36.33 days
5.22
2.29 days
LFT
13.00
9.00
2.00
9.00
13.00
23.00
18.00
29.00
29.00
36.33
36.33
Slack Crit?
7.17
N
5.33
N
0.00
Y
0.00
Y
0.00
Y
0.00
Y
2.83
N
0.00
Y
2.83
N
4.83
N
0.00
Y

(a)
E
I
B
A
H
G
(b and c)
Act Pred
A
B
A
C
A
D B, C
E
D
F
D
G
D
H F, G
I E, F, H
a
3
5
5
1
7
7
6
3
3
m
6
8
6
2
11
9
8
4
5
b Exp t
8 5.83
10 7.83
8 6.17
4 2.17
17 11.33
12 9.17
9 7.83
7 4.33
7 5.00
Var
0.69
0.69
0.25
0.25
2.78
0.69
0.25
0.44
0.44
SD
0.83
0.83
0.50
0.50
1.67
0.83
0.50
0.67
0.67
Critical path =
Project length =
Project variance =
EST
0.00
5.83
5.83
13.67
15.83
15.83
15.83
25.00
29.33
EFT
5.83
13.67
12.00
15.83
27.17
25.00
23.67
29.33
34.33
LST
0.00
5.83
7.50
13.67
18.00
15.83
17.17
25.00
29.33
A-B-D-F-H-I
34.33 days
3.22
1.80 days
(d and e) P(Finish <= 34 days) = 0.4263; P(Finish >= 29 days) = 0.9985
LFT
5.83
13.67
13.67
15.83
29.33
25.00
25.00
29.33
34.33
Slack Crit?
0.00
Y
0.00
Y
1.67
N
0.00
Y
2.17
N
0.00
Y
1.33
N
0.00
Y
0.00
Y

(a)
I
A
D
F
H
Star
t
End
(b and c)
Act
Pred
10
12
Exp t
10.0
0
Var
7.17
0.25
10
20
30
3.17
20.0
0
0.03
11.1
1
0.11
B, D, E
10
11
7.00
10.0
0
B, D, E
10
0.44
14
15
16
10
11
13
7.33
15.0
0
11.1
7
G, H
7.00
0.11
I, J
6.67
0.44
G, H
2.17
0.25
0.44
0.11
0.11
0.25
SD
0.6
7
0.5
0
0.1
7
3.3
3
0.3
3
0.3
3
0.6
7
0.3
3
0.5
0
0.3
3
0.6
7
0.5
0
Critical path =
Project length =
Project variance =
EST
0.00
EFT
10.0
0
0.00
7.17
0.00
10.0
0
3.17
30.0
0
10.1
7
40.0
0
37.3
3
55.0
0
51.1
7
62.0
0
68.6
7
57.1
7
3.17
30.0
0
30.0
0
40.0
0
40.0
0
55.0
0
62.0
0
55.0
0
A-D-F-H-J-K
68.67 days
12.33
3.51 days
LST
0.00
22.8
3
19.8
3
10.0
0
23.0
0
30.0
0
47.6
7
40.0
0
50.8
3
55.0
0
62.0
0
66.5
0
LFT Slack
10.0
0 0.00
30.0 22.8
0
3
23.0 19.8
0
3
30.0
0 0.00
30.0 19.8
0
3
40.0
0 0.00
55.0 17.6
0
7
55.0
0 0.00
62.0 10.8
0
3
62.0
0 0.00
68.6
7 0.00
68.6 11.5
7
0
Crit?
Y
N
N
Y
N
Y
N
Y
N
Y
Y
N

(a)
H
A
E
(b and c)
Act Pred
-
a
4
m
8
b
13
10
15
A
B
14
20
16
19
C
D
11
D, E
C, F
11
E
F
G
G, H
H
I
Exp t
Var
8.17
2.25
9.83
13.8
3
15.3
3
3.36
8.83
0.69
3.83
0.25
7.17
1.36
5.33
1.00
3.00
0.11
4.69
2.78
SD
1.5
0
1.8
3
2.1
7
1.6
7
0.8
3
0.5
0
1.1
7
1.0
0
0.3
3
Critical path =
Project length =
Project variance =
EST
EFT
LST
LFT
Slack
Crit?
0.00
8.17
18.0
0
31.8
3
33.3
3
26.8
3
37.1
7
44.3
3
49.6
7
52.6
7
0.00
8.17
18.0
0
37.1
7
33.3
3
33.3
3
37.1
7
44.3
3
49.6
7
52.6
7
0.00
0.00
5.33
0.00
6.50
0.00
0.00
0.00
0.00
8.17
18.0
0
18.0
0
18.0
0
33.3
3
37.1
7
44.3
3
49.6
7
A-B-D-F-G-H-I
52.67 days
11.11
3.33 days
8.17
23.3
3
18.0
0
24.5
0
33.3
3
37.1
7
44.3
3
49.6
7

(a)
H
D
A
Star
t
C
J
(b and c)
Act Pred
-
a
3
m
7
b
13
10
17
A, B
Exp t
A
B
C
12
14
7.33
10.3
3
5.17
11.1
7
5.17
15
12
6.17
8.17
10
12
F, H
G, I
10
9.67
4.50
7.00
Var
2.7
8
4.0
0
0.6
9
2.2
5
1.3
6
4.6
9
1.3
6
1.0
0
0.6
9
1.0
0
SD
1.6
7
2.0
0
0.8
3
1.5
0
1.1
7
2.1
7
1.1
7
1.0
0
0.8
3
1.0
0
Critical path =
Project length =
Project variance =
EST
EFT
LST
0.00
7.33
10.3
3
15.5
0
26.6
7
20.6
7
26.8
3
35.0
0
36.3
3
40.8
3
47.8
3
3.00
0.00
10.3
3
15.5
0
15.5
0
20.6
7
26.8
3
26.6
7
36.3
3
40.8
3
B-C-D-H-I-J
47.83 days
9.64
3.10 days

(a) P(need >= 17 months) = 0.9772
(b) P(need <= 20 months) = 0.3085
0.00
10.3
3
15.5
0
21.3
3
26.5
0
32.6
7
26.6
7
36.3
3
40.8
3
LFT Slack Crit?

10.3
3 3.00 N
10.3
3 0.00 Y
15.5
0 0.00 Y
26.6
7 0.00 Y
26.5
0 5.83 N
32.6
7 5.83 N
40.8
3 5.83 N
36.3
3 0.00 Y
40.8
3 0.00 Y
47.8
3 0.00 Y
(c) P(need >= 23 months) = 0.1587

(d) P(need <= 25 months) = 0.9772

(a) P(need <= 30 weeks) = 0.8944
(b) P(need <= 22 weeks) = 0.2266
(c) 99% completion time = 34.31
(d) 85% completion time = 29.15
Activity
A
B
C
D
E
F
G
H
Budgeted
cost ($)
$22,000
$30,000
$26,000
$48,000
$56,000
$30,000
$80,000
$16,000
%
Value of work
complete completed
100%
$22,000
100%
$30,000
100%
$26,000
100%
$48,000
50%
$28,000
60%
$18,000
10%
$8,000
10%
$1,600
Total
$181,600
Actual Difference
cost ($)
($)
$20,000 -$2,000
$36,000 $6,000
$26,000
$0
$44,000 -$4,000
$25,000 -$3,000
$15,000 -$3,000
$5,000 -$3,000
$1,000
-$600
$172,00
0
-$9,600
Underrun
7-25. See file P7-25.XLS for the full chart. The first 10 months are shown here.
Using EST:
A
B
C
D
E
F
G
H
Per day =
1
2
3
4
5
6
7
8
9
10
$1,667 $1,667 $1,667 $1,667 $1,667 $1,667
$7,000 $7,000
$714 $714 $714 $714 $714 $714
$714
$2,000 $2,000 $2,000
$1,400 $1,400 $1,400 $1,400
$1,667 $8,667 $8,667 $2,381 $4,381 $4,381 $4,114 $2,114 $2,114 $2,114
$19,00
Cumulative = $1,667 $10,333
0
$21,381 $25,762 $30,143 $34,257 $36,371 $38,486 $40,600
Using LST:
A
B
C
D
E
F
G
H
1
2
3
4
5
6
$1,667 $1,667 $1,667 $1,667 $1,667 $1,667
$7,000 $7,000
$714 $714 $714
$714
$714
$714
10
$714
$2,000
$1,400 $1,400 $1,400 $1,400
Per month = $1,667 $1,667 $1,667 $2,381 $9,381 $9,381 $2,114 $2,114 $2,114 $4,114
Cumulative = $1,667 $3,333 $5,000 $7,381 $16,762 $26,143 $28,257 $30,371 $32,486 $36,600

Activity
A
B
C
D
E
F
G
H
I
J
K
L
M
Budgeted
%
Value of work
cost ($) complete completed
$10,000 100%
$10,000
$14,000 100%
$14,000
$5,000
100%
$5,000
$6,000
100%
$6,000
$14,000
80%
$11,200
$13,000
13%
$1,690
$4,000
100%
$4,000
$6,000
20%
$1,200
$18,000
0%
$0
$12,000
0%
$0
$10,000
0%
$0
$16,000
0%
$0
$18,000
0%
$0
Total
$53,090
Actual Difference
cost ($)
($)
$13,000 $3,000
$12,000 -$2,000
$6,000 $1,000
$6,000
$0
$12,000 $800
$1,000 -$690
$4,500
$500
$500
-$700
$0
$0
$0
$0
$0
$0
$0
$0
$0
$0
$55,000 $1,910
Overrun
7-27. See file P7-27.XLS for the full chart. The first 10 weeks are shown here.
Using EST:
A
B
C
D
E
F
Per day =
Cumulative =
1
$700
2
$700
10
$1,600 $1,600 $1,600

$1,000 $1,000 $1,000 $1,000
$1,400 $1,400
$800
$800
$800
$500
$700 $700 $2,600 $2,600 $2,600 $1,000 $2,200 $2,200 $800
$500
$700 $1,400 $4,000 $6,600 $9,200 $10,200 $12,400 $14,600 $15,400 $15,900
Using LST:
A
B
C
D
E
F
Per month =
Cumulative =
1
$700
2
$700
10
$1,600 $1,600 $1,600

$1,000 $1,000 $1,000 $1,000
$800
$1,400 $1,400
$800
$800
$500
$700 $700 $1,000 $1,000 $2,600 $2,600 $2,400 $2,200 $2,200 $500
$700 $1,400 $2,400 $3,400 $6,000 $8,600 $11,000 $13,200 $15,400 $15,900

Activity
A
B
C
D
E
F
Budgeted
%
Value of work
cost ($) complete completed
$1,400
100%
$1,400
$4,800
100%
$4,800
$4,000
100%
$4,000
$2,800
70%
$1,960
$2,400
70%
$1,680
$1,500
0%
$0
Total
$13,840
Actual Difference
cost ($)
($)
$1,500
$100
$4,500 -$300
$4,000
$0
$2,800
$840
$2,000
$320
$0
$0
$14,800 $960
Overrun
7-29. Project crashing by hand. The current critical path is ACEGH. Total time is 15 weeks.
1. Activity A is the cheapest critical activity to crash. Reduce activity A by 1 week at a cost of $750.
There are now two critical paths: ACEGH and BDGH.
2. Reduce activity G by 1 week at a cost of $1,500. The total completion time is now 13 weeks.
3. Since activity G can be reduced all the way down to 2 weeks, we continue to reduce it by 2 more weeks
(down to a duration of 2 weeks) at a cost of $1,500 per week. The project completion time is now 11
weeks and the total crash cost is $750 + $1,500*3 = $5,250. Note: Path ADGH also becomes critical
when the project is crashed to 14 weeks. However, all activities on this path are also included in the two
critical paths we considered: ACEGH and BDGH.
Note: The Excel solution is shown in file P7-29.XLS.
7-30. Let Xi be the start time of activity i and Yi be the amount of time reduced for activity i, where i = A,
B, C, D, E, F, and G. Let XEnd = project completion time.
Objective: Minimize crashing cost = $600YA + $700YB + $0YC + $75YD + $50YE + $1,000YF + $250YG
Subject to:
YA 1
YB 1
YC 0
YD 4
YE 3
YF 1
YG 2
XEnd 10
XD XA + 3 - YA
XE XB + 2 - YB
XF XC + 1 - YC
XG XD + 7 - YD
XG XE + 6 - YE
XEnd XF + 2 - YF
XEnd XG + 4 - YG
All Xi, Yi 0
Solution: See file P7-30.XLS for the Excel setup and solution of this LP model. The optimal solution is to
crash activity D by 4 weeks and activity E by 2 weeks. The total crashing cost is $400.
7-31. See file P7-31.XLS for the Excel setup and solution of this LP model.
Crash A Crash B Crash C Crash D Crash E Crash F Crash G Crash H
Solution
2.0
0.0
0.0
1.0
1.0
1.0
0.0
1.0
Crash cost
$300
$800
$300
$600
$500
$700
$650
$500 $2,900
7-32. See file P7-32.XLS for the Excel setup and solution of this LP model.
Crash A Crash B Crash C Crash D Crash E Crash F Crash G Crash H
Solution
2.0
2.0
1.0
0.0
1.0
1.0
2.0
1.0
Crash cost
$750
$850
$300
$500
$700
$800
$900
$1,200 $8,000
7-33. See file P7-33.XLS. The project network for Team A is as follows.
The expected time, variance, EST, EFT, LST, LFT, and slack for each activity are as follows.
Act
Pred
Exp t
4.00
5.17
7.83
3.17
7.17
4.00
3.83
4.17
2.17
10
2.83
11
12
9, 10
11
3
4
4
6
6
7
4.17
5.83
Var
0.1
1
0.2
5
0.2
5
0.2
5
0.2
5
0.1
1
0.2
5
0.2
5
0.2
5
0.2
5
0.2
5
0.2
SD
EST
EFT
LST
LFT
Slack
Crit?
0.33
0.00
4.00
0.00
0.00
0.50
4.00
6.00
2.00
0.50
4.00
9.17
11.8
3
4.00
11.1
7
11.8
3
0.00
0.50
4.00
6.67
4.00
2.83
0.33
4.00
8.00
6.17
10.1
7
2.17
0.50
2.17
0.50
7.17
11.8
3
8.00
11.8
3
11.3
3
14.0
0
12.0
0
18.1
7
24.0
9.83
14.0
0
10.1
7
14.0
0
14.0
0
14.0
0
14.0
0
18.1
7
24.0
2.67
0.50
7.17
11.1
7
2.67
0.00
2.00
0.00
0.00
Y
Y
0.50
0.50
0.50
0.50
9.17
14.0
0
18.1
4.00
6.83
9.83
11.8
3
11.1
7
14.0
0
18.1
13
12
1
0
14
13
4.17
15
5, 7, 8, 9, 10
4.00
16
15
4.00
17
14
3.00
18
16, 17
4.83
8.00
Critical path =
Project length =
5
0.4
4
0.2
5
0.1
1
0.4
4
0.1
1
0.2
5
7
24.0
0
32.0
0
14.0
0
18.0
0
36.1
7
39.1
7
0.67
0.50
0.33
0.67
0.33
0.50
0
32.0
0
36.1
7
18.0
0
22.0
0
39.1
7
44.0
0
7
24.0
0
32.0
0
31.1
7
35.1
7
36.1
7
39.1
7
0
32.0
0
36.1
7
35.1
7
39.1
7
39.1
7
44.0
0
0.00
0.00
17.1
7
17.1
7
0.00
0.00
N
N
1-3-9-11-12-13-14-17-18
44 weeks
7-34. See file P7-34.XLS. The project network for Bender Construction Co. is as follows.
Act
Pred
Exp t
1.0
4.00
5.00
3.67
2.0
3.00
4.00
3.00
3.0
4.00
5.00
4.00
7.0
8.00
9.00
8.00
4.0
4.00
5.00
4.17
1.0
2.00
4.00
2.17
4.0
5.00
6.00
5.00
1.0
2.00
4.00
2.17
Var
0.44
4
0.11
1
0.11
1
0.11
1
0.02
8
0.25
0
0.11
1
0.25
0
SD
EST
EFT
LST
0.67
0.00
3.67
0.33
0.00
3.00
0.33
0.00
4.00
9.00
16.5
0
14.5
0
0.33
0.00
8.00
0.17
3.67
7.83
0.50
4.00
0.33
8.00
13.0
0
6.17
13.0
0
15.1
7
0.50
3.50
12.6
7
18.5
0
11.5
0
16.5
0
LFT
12.6
7
19.5
0
18.5
0
11.5
0
16.8
3
20.6
7
16.5
0
18.6
7
Slack
Crit?
9.00
16.5
0
14.5
0
3.50
9.00
14.5
0
3.50
3.50
N
N
3.0
4.00
4.00
3.83
10
11
1.0
18.
0
1.00
20.0
0
2.00
26.0
0
1.17
20.6
7
12
1.0
2.00
3.00
2.00
13
8
6,9,10,11,1
2
1.0
1.00
2.00
1.17
14
13
0.1
0.14
0.16
0.14
15
14
0.2
0.30
0.40
0.30
16
14
1.0
1.00
2.00
1.17
17
16
1.0
2.00
3.00
2.00
18
15,17
3.0
5.00
7.00
5.00
19
18
0.1
0.10
0.20
0.12
20
19
0.1
0.14
0.16
0.14
21
19
2.0
3.00
6.00
3.33
22
20
0.1
0.10
0.20
0.12
23
21,22
0.0
0.20
0.20
0.17
Critical path =
Project length =
0.02
8
0.02
8
1.77
8
0.11
1
0.02
8
0.00
0
0.00
1
0.02
8
0.11
1
0.44
4
0.00
0
0.00
0
0.44
4
0.00
0
0.00
1
0.17
7.83
0.17
3.00
1.33
0.00
15.1
7
20.6
7
21.8
3
21.9
7
21.9
7
23.1
4
25.1
4
30.1
4
30.2
5
30.2
5
30.3
9
33.5
9
0.33
0.17
0.01
0.03
0.17
0.33
0.67
0.02
0.01
0.67
0.02
0.03
11.6
7
4.17
20.6
7
17.1
7
21.8
3
21.9
7
22.2
7
23.1
4
25.1
4
30.1
4
30.2
5
30.3
9
33.5
9
30.5
1
33.7
5
11-13-14-16-17-18-19-21-23
33.75 weeks
16.8
3
19.5
0
0.00
18.6
7
20.6
7
21.8
3
24.8
4
21.9
7
23.1
4
25.1
4
30.1
4
33.3
3
30.2
5
33.4
7
33.5
9
20.6
7
20.6
7
20.6
7
20.6
7
21.8
3
21.9
7
25.1
4
23.1
4
25.1
4
30.1
4
30.2
5
33.4
7
33.5
9
33.5
9
33.7
5
9.00
16.5
0
0.00
3.50
0.00
0.00
2.87
0.00
0.00
0.00
0.00
3.08
0.00
3.08
0.00
7-35. The overall purpose of Problem 7-35 is to have students use a project approach in attempting to
solve a problem that almost all students face. The first step is for students to list all courses that they must
take, including possible electives, to get a degree from their particular college or university. For every
course, students should list all the immediate predecessors. Then students are asked to attempt to develop
a network diagram that shows these courses and their immediate predecessors or prerequisite courses.
This problem can also point out some of the limitations of the use of project management. As
students try to solve this problem, they may run into several difficulties. First, it is difficult to incorporate
a minimum or maximum number of courses that a student can take during a given semester. In addition, it
is difficult to schedule elective courses. Some elective courses have prerequisites, while others may not.
Even so, some of the overall approaches of network analysis can be helpful in terms of laying out the
courses that are required and their prerequisites.
Students can also be asked to think about other quantitative techniques that can be used in solving
this problem. One of the most appropriate approaches would be to use LP to incorporate many of the
constraints, such as minimum and maximum number of credit hours per semester, that are difficult or
impossible to incorporate in a project network.
7-36.
(a) See file P7-36.XLS, sheet (a). The project network is as follows:
Act
Pred
Exp t
1.0
2.0
4.0
2.17
3.0
10.
0
3.5
12.
0
4.0
13.
0
3.50
11.8
3
4.0
5.0
7.0
5.17
2.0
4.0
5.0
3.83
6.0
7.0
8.0
7.00
Var
0.2
5
0.0
3
0.2
5
0.2
5
0.2
5
0.1
1
SD
EST
EFT
0.50
0.00
2.17
0.17
0.00
0.50
0.00
3.50
11.8
3
0.50
0.00
5.17
0.50
0.00
3.83
0.33
2.17
9.17
LST
10.1
3
11.8
8
0.00
14.6
5
15.9
8
12.3
0
LFT
12.3
0
15.3
8
11.8
3
19.8
2
19.8
2
19.3
0
Slack
10.1
3
11.8
8
Crit?
0.00
14.6
5
15.9
8
10.1
3
N
N
N
N
N
2.0
4.0
5.5
3.92
5.0
9.9
7.7
10.
0
9.0
12.
0
7.47
10.3
2
2.0
4.0
5.0
3.83
2.0
4.0
6.0
4.00
2.0
4.0
6.0
4.00
F, G, H
5.0
6.0
6.5
5.92
J, K, L
1.0
1.1
2.0
1.23
I, M
5.0
7.0
8.0
6.83
5.0
7.0
9.0
7.00
0.3
4
0.4
4
0.1
2
0.2
5
0.4
4
0.4
4
0.0
6
0.0
3
0.2
5
0.4
4
Critical path =
Project length =
0.58
0.50
3.50
11.8
3
11.8
3
11.8
3
7.42
19.3
0
22.1
5
15.6
7
0.67
5.17
9.17
0.67
3.83
19.3
0
15.6
7
25.2
2
16.9
0
7.83
25.2
2
16.9
0
32.0
5
23.9
0
0.67
0.35
0.25
0.17
0.50
0.67
15.3
8
11.8
3
14.9
0
19.9
8
19.8
2
19.8
2
19.3
0
23.8
2
25.2
2
25.0
5
19.3
0
19.3
0
25.2
2
23.8
2
23.8
2
23.8
2
25.2
2
25.0
5
32.0
5
32.0
5
11.8
8
0.00
3.07
8.15
14.6
5
15.9
8
0.00
8.15
0.00
8.15
N
N
C-H-M-O
32.05 weeks
(b) If activities I and J are not required, we set their expected times and variances to zero. There is no
change to the critical path or the project completion time, as shown in the following revised solution.
Act
Pred
Exp t
1.0
2.0
4.0
2.17
3.0
10.
0
3.5
12.
0
4.0
13.
0
3.50
11.8
3
4.0
5.0
7.0
5.17
2.0
4.0
5.0
3.83
6.0
7.0
8.0
7.00
2.0
4.0
5.5
3.92
5.0
9.9
9.0
12.
0
7.47
7.7
10.
0
2.0
4.0
5.0
0.00
2.0
4.0
6.0
4.00
2.0
4.0
6.0
4.00
0.00
Var
0.2
5
0.0
3
0.2
5
0.2
5
0.2
5
0.1
1
0.3
4
0.4
4
0.0
0
0.0
0
0.4
4
0.4
4
SD
EST
EFT
0.50
0.00
2.17
0.17
0.00
0.50
0.00
3.50
11.8
3
0.50
0.00
5.17
0.50
0.00
3.83
0.33
2.17
9.17
0.58
0.00
3.50
11.8
3
11.8
3
11.8
3
7.42
19.3
0
11.8
3
11.8
3
0.67
5.17
9.17
0.67
3.83
7.83
0.67
0.00
LST
10.1
3
11.8
8
0.00
14.6
5
15.9
8
12.3
0
15.3
8
11.8
3
25.2
2
23.8
2
19.8
2
19.8
2
LFT
12.3
0
15.3
8
11.8
3
19.8
2
19.8
2
19.3
0
19.3
0
19.3
0
25.2
2
23.8
2
23.8
2
23.8
2
Slack
10.1
3
11.8
8
Crit?
0.00
14.6
5
15.9
8
10.1
3
11.8
8
0.00
13.3
8
11.9
8
14.6
5
15.9
8
N
N
N
N
N
N
N
N
N
N
F, G, H
5.0
6.0
6.5
5.92
J, K, L
1.0
1.1
2.0
1.23
I, M
5.0
7.0
8.0
6.83
5.0
7.0
9.0
7.00
0.0
6
0.0
3
0.2
5
0.4
4
Critical path =
Project length =
0.25
0.17
0.50
0.67
19.3
0
11.8
3
25.2
2
13.0
7
C-H-M-O
32.05 weeks
25.2
2
13.0
7
32.0
5
20.0
7
19.3
0
23.8
2
25.2
2
25.0
5
25.2
2
25.0
5
32.0
5
32.0
5
0.00
11.9
8
0.00
11.9
8
7-37.
(a) See file P7-37.XLS, sheet (a). The project network is as follows:
Act
Pred
Exp t
3.00
6.17
1.17
11
9.17
1.50
3.17
1.83
10
11
5.17
10.0
0
1.83
2.17
4.17
2.33
11
9.17
1.33
Var
0.1
1
0.2
5
0.0
3
0.2
5
0.2
5
0.0
3
0.0
3
0.0
3
0.1
1
0.0
3
0.0
3
0.2
5
0.1
1
0.2
5
0.1
1
SD
EST
EFT
0.33
0.00
3.00
0.50
0.00
6.17
0.17
0.00
1.17
0.50
0.00
9.17
0.50
3.00
4.50
0.17
6.17
9.33
0.17
6.17
8.00
0.17
1.17
0.33
9.17
0.17
9.17
6.33
19.1
7
11.0
0
0.17
4.50
0.50
9.33
0.33
8.00
19.1
7
19.1
7
0.50
0.33
6.67
13.5
0
10.3
3
28.3
3
20.5
0
LST
15.5
0
12.6
7
32.0
0
LFT
18.5
0
18.8
3
33.1
7
Slack
15.5
0
12.6
7
32.0
0
Crit?
0.00
18.5
0
18.8
3
22.0
0
33.1
7
9.17
20.0
0
22.0
0
23.8
3
38.3
3
19.1
7
27.8
3
22.1
7
26.1
7
26.1
7
28.3
3
31.3
3
0.00
15.5
0
12.6
7
15.8
3
32.0
0
0.00
16.8
3
15.5
0
12.6
7
15.8
3
0.00
10.8
3
9.17
26.0
0
20.0
0
22.0
0
23.8
3
19.1
7
30.0
0
N
N
N
N
N
N
N
N
N
N
N
4.67
6.17
L, M
2.17
6.17
3.17
Q, R
10
11
2.00
10.0
0
0.4
4
0.0
3
0.2
5
0.0
3
0.0
3
0.1
1
0.1
1
0.67
0.17
0.50
0.17
0.17
0.33
0.33
Critical path =
Project length =
Project variance =
11.0
0
6.67
13.5
0
28.3
3
20.5
0
15.6
7
15.6
7
15.6
7
12.8
3
15.6
7
34.5
0
23.6
7
17.6
7
25.6
7
27.8
3
22.1
7
26.1
7
28.3
3
31.3
3
32.5
0
28.3
3
32.5
0
28.3
3
28.3
3
34.5
0
34.5
0
34.5
0
38.3
3
16.8
3
15.5
0
12.6
7
0.00
10.8
3
16.8
3
12.6
7
N
N
N
Y
N
N
N
D-I-N-S-W
38.33 weeks
0.89
0.94 weeks
(b) P(Finish <= 40 weeks) = 0.9617

(c) If activities D and I are already completed, we set their expected times and variances to zero. The new
critical path is BFLRV, and the new project time is 25.67 weeks. The revised solution is as follows
(see file P7-37, sheet (b) for calculation).
Act
Pred
Exp t
3.00
6.17
1.17
11
0.00
1.50
3.17
1.83
5.17
10
11
0.00
1.83
2.17
L
M
F
G
3
2
4
2
6
4
4.17
2.33
Var
0.1
1
0.2
5
0.0
3
0.0
0
0.2
5
0.0
3
0.0
3
0.0
3
0.0
0
0.0
3
0.0
3
0.2
5
0.1
SD
EST
EFT
LST
LFT
Slack
Crit?
0.33
0.00
3.00
2.83
5.83
2.83
0.50
0.00
6.17
0.00
1.17
6.17
20.5
0
0.00
19.3
3
0.17
0.00
19.3
3
0.00
0.00
0.00
6.50
6.50
6.50
0.50
3.00
4.50
5.83
7.33
2.83
0.17
6.17
9.33
6.17
0.00
0.17
6.17
8.00
1.17
6.33
3.17
19.3
3
0.17
9.33
20.5
0
9.33
11.1
7
25.6
7
0.00
0.00
0.00
0.00
1.83
6.50
15.1
7
6.50
13.3
3
0.17
6.50
13.3
3
0.17
4.50
7.33
9.33
8.00
9.50
13.5
0
13.5
2.83
0.50
0.33
6.67
13.5
0
10.3
0.00
3.17
Y
N
9.33
11.1
11
9.17
1.33
4.67
6.17
L, M
2.17
6.17
3.17
Q, R
10
11
2.00
10.0
0
1
0.2
5
0.1
1
0.4
4
0.0
3
0.2
5
0.0
3
0.0
3
0.1
1
0.1
1
7
6.50
17.3
3
15.1
7
0.50
0.00
9.17
0.33
0.00
1.33
0.67
1.83
0.17
0.50
6.67
13.5
0
0.17
9.17
6.50
12.8
3
15.6
7
15.3
3
0.17
1.33
4.50
0.33
6.50
15.6
7
8.50
25.6
7
0.33
Critical path =
Project length =
Project variance =
B-F-L-R-V
25.67 weeks
0.89
0.94 weeks
9.50
13.5
0
15.6
7
18.6
7
19.8
3
15.6
7
0
15.6
7
18.6
7
19.8
3
15.6
7
15.6
7
21.8
3
21.8
3
21.8
3
25.6
7
6.50
17.3
3
13.3
3
2.83
0.00
6.50
17.3
3
13.3
3
0.00
N
N
N
N
Case: Haygood Brothers Construction Co.

See file P7-Haygood.XLS. The project network is as follows:
(1 and 2) The expected time, variance, EST, EFT, LST, LFT, and slack for each activity are as follows.
Act
Pred
Exp t
5.00
5.00
7.00
5.00
4.00
5.33
5.00
4.33
D,I
5
1
0
7
1
1
9
1
2
7.00
11.0
0
F,G,H,J
6.00
F,G,H,J
8.00
9
1
0
7.00
6.00
M,O
3.00
5.67
Var
0.1
1
1.0
0
0.4
4
0.1
1
0.4
4
1.0
0
0.1
1
0.4
4
0.4
4
0.1
1
0.4
4
0.1
1
1.0
0
0.4
4
0.1
1
0.1
1
SD
EST
EFT
LST
LFT
Slack
Crit?
0.33
0.00
0.00
5.00
10.0
0
10.0
0
17.0
0
21.0
0
21.0
0
21.0
0
21.0
0
28.0
0
39.0
0
39.0
0
47.0
0
45.0
0
52.0
0
58.0
0
5.00
10.0
0
17.0
0
28.0
0
21.0
0
39.0
0
39.0
0
39.0
0
28.0
0
39.0
0
45.0
0
52.3
3
58.0
0
52.0
0
58.0
0
61.0
0
0.00
1.00
5.00
10.0
0
17.0
0
15.0
0
21.0
0
26.3
3
26.0
0
25.3
3
28.0
0
39.0
0
45.0
0
47.0
0
52.6
7
52.0
0
58.0
0
61.0
0
0.00
0.00
13.0
0
0.00
12.6
7
13.0
0
13.6
7
0.00
0.00
0.00
5.33
5.33
0.00
0.00
0.00
0.67
0.33
0.67
1.00
0.33
0.67
0.67
0.33
0.67
0.33
1.00
0.67
0.33
0.33
5.00
10.0
0
23.0
0
17.0
0
33.6
7
34.0
0
34.6
7
21.0
0
28.0
0
39.0
0
44.3
3
52.3
3
45.0
0
52.0
0
58.0
0
N
N
N
Critical path =
Project length =
Project variance =
(3) P(Finish <= 60 days) = 0.3008.
A-B-C-E-I-J-K-N-O-P
61.00 days
3.67
1.91 days
Case: Family Planning Research Center

This case covers three aspects of project management: (1) critical path scheduling, (2) crashing, and (3)
resource (personnel) leveling or smoothing.
(1) The statement by Mr. Odaga that the project will take 94 days is a red herring. That is the sum of all
the task times that would be the length of the project only if all of the tasks were done serially with none
in parallel. The actual project network is as follows.
D
A
E
G
Star
t
The EST, EFT, LST, LFT, and slack for each activity are as follows (see file P7-Family.XLS, sheet (a)
for calculations).
Act
A
B
C
D
E
F
G
H
I
J
K
Pred
A
A
B, E
A, B
C
H
D, F, G, I
J
Time EST EFT LST LFT Slack

5
0
5
8
13
8
7
0
7
12
19
12
5
0
5
0
5
0
3
5
8
19
22
14
7
5
12
13
20
8
2
12
14
20
22
8
3
7
10
19
22
12
10
5
15
5
15
0
7
15
22
15
22
0
15
22
37
22
37
0
30
37
67
37
67
0
Critical?
N
N
Y
N
N
N
N
Y
Y
Y
Y
Critical path = C-H-I-J-K

Project length = 67 days
(2) Workforce smoothing. The following table shows the staffing requirement with each activity
beginning on its earliest start date [see file P7-Family.XLS, sheet (b)]. There are five days (i.e., days 6 to
10) on which the requirements are for more than 10 workers.
Activity
A
B
C
D
E
F
G
H
I
J
K
Total
1
2
3
2
2
2
3
2
3
2
3
2
4
2
3
2
5
2
3
2
1
4
6
9 10 11 12 13 14 15 16 17 18 19 20 21 22
1
4
1
4
2
6
2
6
2
6
4
6
4
6
7 14 14 13 12 12 10 10 7
If we delay some of the non-critical activities (D, E, F, and G), we get the following schedule and
workforce requirements [see file P7-Family.XLS, sheet (b)]. This schedule can be accomplished with the
10 available workers.
Activity
A
B
C
D
E
F
G
H
I
J
K
Total
1
2
3
2
2
2
3
2
3
2
3
2
4
2
3
2
5 6
2
3 3
2
7 9
9 10 11 12 13 14 15 16 17 18 19 20 21 22
4
6
4
6
4
6
4
6
1
2
4
6
9 10 10 10 10 10 10 10 8
(3) See file P7-Family.XLS, sheet (c).

Crash days
Crash cost
Crash ACrash BCrash CCrash DCrash ECrash FCrash G Crash H Crash I Crash J Crash K
0.0
0.0
2.0
0.0
0.0
0.0
0.0
0.0
5.0
0.0
0.0
$100 $150
$50
$250 $150 $1,000 $500 $200
$80
$400
$400 $500

Ch07 Solutions

Transféré par

Informations du document

Description originale:

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Ch07 Solutions

Transféré par

Droits d'auteur :

Formats disponibles

CHAPTER 7

LFT Slack Critical?

7-13. See file P7-13.XLS.

LFT Slack Critical?

7-14. See file P7-14.XLS.

LFT Slack Critical?

7-15. See file P7-15.XLS.

7-16. See file P7-16.XLS.

EST EFT LST

LST Slack Crit?

7-17. See file P7-17.XLS.

7-18. See file P7-18.XLS.

(d and e) P(Finish <= 34 days) = 0.4263; P(Finish >= 29 days) = 0.9985

7-19. See file P7-19.XLS.

(d and e) P(Finish <= 70 days) = 0.6479; P(Finish >= 75 days) = 0.0357

7-20. See file P7-20.XLS.

(d and e) P(Finish <= 57 days) = 0.9032; P(Finish >= 50 days) = 0.7881

7-21. See file P7-21.XLS.

(d and e) P(Finish <= 49 days) = 0.6465; P(Finish >= 54 days) = 0.0235

LFT Slack Crit?

(c) P(need >= 23 months) = 0.1587

7-23. See file P7-23.XLS.

7-26. See file P7-26.XLS.

$1,600 $1,600 $1,600

$1,600 $1,600 $1,600

7-28. See file P7-28.XLS.

(b) P(Finish <= 40 weeks) = 0.9617

Case: Haygood Brothers Construction Co.

Case: Family Planning Research Center

Time EST EFT LST LFT Slack

Critical path = C-H-I-J-K

(3) See file P7-Family.XLS, sheet (c).

Vous aimerez peut-être aussi