Required:
a. Linear Programming Model
b. Activity to Crash
c. Total Cost
Solutions:
*To get all requirements, it would be necessary to start off with knowing the critical path
*Based on the given Activity Times, this is the table for slack
Earliest Latest Earliest Latest Critical
Activity Start Start Finish Finish Slack Activity
A 0 0 3 3 0 /
B 0 1 2 3 1
C 3 3 8 8 0 /
D 2 3 7 8 1
E 8 8 14 14 0 /
F 8 10 10 12 2
G 10 12 12 14 2
Critical Path: A-C-E
Total Cost of the Activities (Using Normal Values)
= ∑CN = 800 + 1200 + 2000 + 1500 + 1800 + 600 + 500 = 8400
Max Reduction in Time Crash Cost per Day [(Cost under
Activity (Time Expected – Time Under Max Time Expected – Cost under Max
Crashing) Crashing) / Max Crash Days]
A 3-2 = 1 600
B 2–1=1 700
C 5–3=2 400
D 5–3=2 400
E 6–4=2 500
F 2–1=1 400
G 2–1=1 500
Min 600yA + 700yB + 400yC + 400yD + 500yE + 400yF + 500yG
s.t.
xA + yA ≥ 3
` xB + yB ≥ 2
xC + yC – xA ≥ 5
xD + yD – xB ≥ 5
xE + yE – xC ≥ 6
xE + yE – xD ≥ 6
xF + yF – xC ≥ 2
xF + yF – xD ≥ 2
xG + yG – xF ≥ 2
xFIN – xE ≥ 0
xFIN – xG ≥ 0
xFIN ≤ 12
yA ≤ 1
yB ≤ 1
yC ≤ 2
yD ≤ 2
yE ≤ 2
yF ≤ 1
yG ≤ 1
All x, y ≥ 0
Activity Crash Crashing Cost
C 1 day 400
E 1 day 500
Total 900
Total Cost = Total Cost of the Activities + Crashing Cost = 8400 + 900 = 9300