Scribd
Upload
876 views5 pages

Case Problem R.C. Coleman

The document summarizes an example case problem involving project scheduling and crashing for a project with activities A through K. It [1] presents the initial network diagram and expected times/variances for each activity, [2] calculates that there is a 10% chance of completing the project in 40 weeks or less, and [3] uses linear programming to determine optimal crashing decisions to reduce the expected completion time to 38 weeks by crashing activities B, F, J, and K.

Uploaded by

Something Chic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
876 views5 pages

Case Problem R.C. Coleman

The document summarizes an example case problem involving project scheduling and crashing for a project with activities A through K. It [1] presents the initial network diagram and expected times/variances for each activity, [2] calculates that there is a 10% chance of completing the project in 40 weeks or less, and [3] uses linear programming to determine optimal crashing decisions to reduce the expected completion time to 38 weeks by crashing activities B, F, J, and K.

Uploaded by

Something Chic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Chapter 9

Project Scheduling: PERT/CPM

Case Problem: R.C. Coleman

1. R.C. Coleman's Project Network

A D I

Start C E F K Finish

B G H J

Activity Expected Time Variance

A 6 0.44

B 9 2.78

C 4 0.44

D 12 7.11

E 10 1.00

F 6 0.44

G 8 7.11

H 6 0.44

I 7 2.78

J 4 0.11

K 4 0.44

Earliest Latest Earliest Latest Critical


Activity Start Start Finish Finish Slack Activity

A 0 3 6 9 3
B 0 0 9 9 0 Yes
C 9 9 13 13 0 Yes
D 13 17 25 29 4
E 13 13 23 23 0 Yes
F 23 23 29 29 0 Yes
G 13 21 21 29 8
H 29 29 35 35 0 Yes I 29 32 36
39 3
J 35 35 39 39 0 Yes
K 39 39 43 43 0 Yes

Chapter 9

The expected project completion time is 43 weeks. The critical path activities are B-C-E-F-H-J-K.
The variance of the critical path is 5.67.

40−43
z ==−1.26
5.67

Area = 0.3962

P(T ≤ 40) = 0.5000 - 0.3962 = 0.1038

Given the above calculations, we can conclude that there is about a 10% chance that the project can be
completed in 40 weeks or less. Coleman should consider crashing project activities.

2.

20%

80%

Planned project Desires 40-week


completion time completion time

For 80% chance,


z = +0.84
Thus

40−E T( )
=
0.84
5.67

Solve for E(T) = 38 weeks.

R.C. Coleman should crash activities to reduce the expected project completion time to 38 weeks.

3. In this section, we will use expected activity times as normal times and use a linear programming
model based on expected times to make the crashing decisions.

Let xi = the completion time for activity i


yi = the amount of crash time for activity i

Solutions to Case Problems

Min 450yA + 400yB + 600yC + 300yD + 1000yE + 550yF + 750yG + 700yH + 800yI + 400yJ +
500yK

s.t.

xA + yA ≥ 6 xK ≤ 38

xB + yB ≥ 9 yA ≤ 2

xC + yC – xA ≥ 4 yB ≤ 2

xC + yC – xB ≥ 4 yC ≤ 2

xD + yD – xC ≥ 12 yD ≤ 4

xE + yE – xC ≥ 10 yE ≤ 3
xF + yF – xE ≥ 6 yF ≤ 2

xG + yG – xC ≥ 8 yG ≤ 3

xH + yH – xF ≥ 6 yH ≤ 2

xH + yH – xG ≥ 6 yI ≤ 3

xI + yI – xD ≥ 7 yJ ≤ 1

xI + yI – xF ≥ 7 yK ≤ 1

xJ + yJ – xH ≥ 4 All xi,yi ≥ 0

xK + yK – xI ≥ 4

xK + yK – xJ ≥ 4

The optimal crashing decisions are as follows:

Crash Activity Weeks Cost

B 2 800
F 1 550
J 1 400
K 1 500
Total 2250

Chapter 9

A revised activity schedule based on these crashing decisions is as follows:

Earliest Latest Earliest Latest Critical


Activity Start Start Finish Finish Slack Activity

A 0 1 6 7 1
B 0 0 7 7 0 Yes
C 7 7 11 11 0 Yes D 11 14 23 26 3
E 11 11 21 21 0 Yes
F 21 21 26 26 0 Yes G 11 18 19
26 7
H 26 26 32 32 0 Yes I 26 28 33
35 2
J 32 32 35 35 0 Yes
K 35 35 38 38 0 Yes

The student should comment on the fact that the crashing decisions may alter the variance in the
project completion time. By defining revised optimistic, most probable, and pessimistic times for
crashed activities B, F, J, and K, a revised variance in the project completion time can be found.
Using this result, a revised probability of a 40-week completion time can be computed.

You might also like