Investigação Operacional Gestão – 3º ano

Exercise 9 (Project Management Exercises)

Application of the algorithm to reduce the project duration

Possible Paths Table

Iteration 0 Iteration 1 Iteration 2 Iteration 3
Paths
Duration Duration Duration Duration
A→D→G 58 58 58−3=55 55−1=54
A→F 27 27 27 27−1=26
B→G 50 50 50−3=47 47
C→E→G 60 60−2=58 58−3=55 55−1=54
C→H 36 36 36 36−1=35

Marginal Cost Table

Iteration 0 Iteration 1 Iteration 2 Iteration 3
Marginal
Act. A.R. C.A.? A.R. C.A.? A.R. C.A.? A.R. C.A.?
Cost
(Y/N) (Y/N) (Y/N) (Y/N)
A 60 2 N 2 Y 2 Y 2-1=1 Y
B 150 3 N 3 N 3 N 3 N
C 75 1 Y 1 Y 1 Y 1-1=0 Y
D 120 1 N 1 Y 1 Y 1 Y
E 55 2 Y 2-2=0 Y 0 Y 0 Y
F 80 3 N 3 N 3 N 3 N
G 65 3 Y 3 Y 3-3=0 Y 0 Y
H 45 1 N 1 N 1 N 1 N

Iterations Table
Activ. Amount Project Costs
Iter. New Critical Path
crashed decreased duration Marginal Added Projecto
0 ---- ---- 60 ---- ---- 4635 C→E→G
1 E min {2,60-58} 58 55 55 x 2 4745 A→D→G
=2

2 G min {3,58-36} 55 65 65 x 3 4940 ----

=3

3 (A, C) min {2,1,55-47} 54 135 135 x 1 5075 ----

=1