CEE 536

CRITICAL PATH METHODS

EXAMPLE PROBLEMS

Photios G. Ioannou, PhD, PE

Professor of Civil and Environmental Engineering
Chachrist Srisuwanrat, Ph.D.
Former Graduate Student Instructor
University of Michigan
Ann Arbor, Michigan 48109-2125

TABLE OF CONTENTS
1. NETWORK CONSTRUCTION -------------------------------------------------------------------- 3
ACTIVITY ON ARROW ........................................................................................ 3
ACTIVITY ON NODE............................................................................................ 3
2. ACTIVITY-ON-ARROW SCHEDULING -------------------------------------------------------13
EVENT APPROACH .......................................................................................... 13
MISSING FLOATS ............................................................................................. 13
3. ACTIVITY-ON-NODE SCHEDULING ----------------------------------------------------------32
4. SCHEDULING USING A LINK MATRIX -------------------------------------------------------46
5. PROJECT UPDATING -----------------------------------------------------------------------------52
6. PERTPNET ----------------------------------------------------------------------------------------54
7. TIME-COST TRADEOFF TABLES--------------------------------------------------------------67
8. TIME-COST TRADEOFF-LP ---------------------------------------------------------------------94
9. RESOUCE LEVELING --------------------------------------------------------------------------- 114
MINIMUM MOMENT METHOD ........................................................................ 114
10. RESOUCE LEVELING --------------------------------------------------------------------------- 155
PACK................................................................................................................ 155
11. OVERLAPPING NETWORKS------------------------------------------------------------------ 181
12. REPETITIVE SCHEDULING METHOD------------------------------------------------------ 192

1. NETWORK CONSTRUCTION

ACTIVITY ON ARROW

ACTIVITY ON NODE

Problem 1.1
a) Construct an activity on arrow network based on the activity descriptions below. Show all your work. Label activities
in the network by their activity letters and node numbers. Remove any redundant dependencies and label dummy
activities DUMMY1, DUMMY2, etc.
b) Construct a precedence network based on the same activity descriptions below. Show all your work. Label activities in
the network by their activity letters and node numbers. Remove all redundant dependencies and arrange activities in
proper sequence steps.

CEE536Example Problems

Activities H, R2, T1 start the project.

Activity T2 can start when Activities H, E1 and S are completed.
Activity E1 also depends on Activity R2.
Activity X follows Activity H and precedes Activity L.
Activity E is preceded by Activities T2 and P1.
The predecessors to Activity G are Activities L, T2 and P1.
The successors to Activity T1 are Activities E1, S, W and D2.
Activity P1 cannot begin until Activity W is finished.
Activity P2 and F follow Activities W and D2, and precede Activities E and R1.
Activity O2 depends on T2 and P1 , and precedes Activity L.

P.G. Ioannou & C. Srisuwanrat

Problem 1.2
a) Construct an activity on arrow network based on the activity descriptions below. Show all your work. Label activities
in the network by their activity letters and node numbers. Remove any redundant dependencies and label dummy
activities DUMMY1, DUMMY2, etc.
b) Construct a precedence network based on the same activity descriptions below. Show all your work. Label activities in
the network by their activity letters and node numbers. Remove all redundant dependencies and arrange activities in
proper sequence steps.

Activity I follows Activity B and precedes Activity Q.

Activity B1 precedes Activity P and follows the completion of Activities Q , K2 , and E.
Activity R follows the completion of Activity B.
Activity S2 follows Activities R and S1, and precedes Activity P.
Activity K3 is preceded by Activities X , L , and Z, and followed by Activities G and F.
Activity E2 precedes Activities A1 , X , L , and Z.
Activity B can start when Activities A1 and X are completed.
The predecessors to Activity S1 are Activities E , G , and F.
Activity E depends on Activity L and E2 and precedes Activities N2, S1 , and K2.
Activity K2 follows Activities N2 , R , and L.
Activity P depends on Activities R and N2.
Activity S2 depends on Activities X, F, and E2.

CEE536Example Problems

P.G. Ioannou & C. Srisuwanrat

Problem 1.3
a) Construct an activity on arrow network based on the activity descriptions below. Show all your work. Label activities
in the network by their activity letters and node numbers. Remove any redundant dependencies and label dummy
activities DUMMY1, DUMMY2, etc.
b) Construct a precedence network based on the same activity descriptions below. Show all your work. Label activities in
the network by their activity letters and node numbers. Remove all redundant dependencies and arrange activities in
proper sequence steps.

The predecessors to Activity Z2 are Activities L , C and R.

The successors to Activity B are Activities E1 , S , W and D2.
Activity E1 also depends on Activity M.
Activity U and F follow Activities W and D2 , and precede Activities E and R1.
Activity Y follows Activities C and R , and followed by Activity L.
Activities D , M , and B start the project.
Activity C can start when Activities D , E1 and S are completed.
Activity R cannot begin until Activity W is finished.
Activity I follows Activity D and precedes Activity L.
Activity E follows Activities C and R.

CEE536Example Problems

P.G. Ioannou & C. Srisuwanrat

Solution 1.1.a

CEE536Example Problems

P.G. Ioannou & C. Srisuwanrat

Solution 1.1.b

ST

R2

E1

T2

T1

P1

P2

D2

R1

CEE536Example Problems

O2

FIN

P.G. Ioannou & C. Srisuwanrat

Solution 1.2.a

K2

Y
M

S1

B1

M
DU
7

Z
L

CEE536Example Problems

P.G. Ioannou & C. Srisuwanrat

Solution 1.2.b

CEE536Example Problems

10

P.G. Ioannou & C. Srisuwanrat

Solution 1.3.a

DUMMY 3
U

R1

Y
M
M
DU 4

E1

E
Z2

DUMMY
5

Y
M
M
U
D 1

CEE536Example Problems

11

P.G. Ioannou & C. Srisuwanrat

Solution 1.3.b

ST

E1

D2

R1

CEE536Example Problems

12

Z2

FIN

P.G. Ioannou & C. Srisuwanrat

2. ACTIVITY-ON-ARROW SCHEDULING

EVENT APPROACH

MISSING FLOATS

Calculation for activity-on-arrow networks

Note:
TF => FF>= INDF and TF >= INTF.
If TF = 0 then all the floats = 0.
If FF = 0 then INDF = 0. Remember that INDF is a part of FF.

CEE536Example Problems

14

P.G. Ioannou & C. Srisuwanra

Problem 2.1 Calculate the schedule dates (TE and TL) and the four floats (TF, FF, INTF, and INDF).

CEE536Example Problems

15

P.G. Ioannou & C. Srisuwanra

Problem 2.2 Calculate the schedule dates (TE and TL) and the four floats (TF, FF, INTF, and INDF).

CEE536Example Problems

16

P.G. Ioannou & C. Srisuwanra

Problem 2.3 Calculate the schedule dates (TE and TL) and the four floats (TF, FF, INTF, and INDF).

CEE536Example Problems

17

P.G. Ioannou & C. Srisuwanra

Problem 2.4 Calculate the schedule dates (TE and TL) and the four floats (TF, FF, INTF, and INDF).

CEE536Example Problems

18

P.G. Ioannou & C. Srisuwanra

Solution 2.1

CEE536Example Problems

19

P.G. Ioannou & C. Srisuwanra

Solution 2.2

CEE536Example Problems

20

P.G. Ioannou & C. Srisuwanra

Solution 2.3

CEE536Example Problems

21

P.G. Ioannou & C. Srisuwanra

Solution 2.4

CEE536Example Problems

22

P.G. Ioannou & C. Srisuwanra

MISSING FLOATS
Calculate TF, FF, and INTF.
1.

14

11

13

15

17

2.

3.
TL = 32
T=5

TF = 8
FF = 2

CEE536Example Problems

23

P.G. Ioannou & C. Srisuwanrat

4.
P

19

25

11

13

15

17

23

29

21

27

5.

FF =4
TF =1

INTF =3
FF =5

CEE536Example Problems

24

P.G. Ioannou & C. Srisuwanrat

FOUR MISSING FLOAT CONCEPTS (please check these concepts with the previous
activity-on-arrow practice)
MS1. ZERO FREE FLOAT
If there is only one link goes into a node, its FF = 0.

FF of activity C = 0
If there are many links go into the same node, at least one of them must have FF = 0.

FF of activity X = 0
MS2. SAME INTERFERE FLOAT
All the links that go into the same node have the same INTF.

According to MS1, FF of X = 0. Thus, INTF of X = 5.

According to MS2, INTF of Z equals to INTF of X, which is 5.
Thus, TF of Z is 11.

CEE536Example Problems

25

P.G. Ioannou & C. Srisuwanrat

MS3. ACTIVITY CHAINS TOTAL FLOAT

Total floats of activities on an activity chain are the same.

Activity Q, W, and E are activity chain. Thus,

TF of Q and E equal to TF of W according to MS3.
FF of Q, W, and E equal to 0 according to MS1.

CEE536Example Problems

26

P.G. Ioannou & C. Srisuwanrat

Solution
1.
1.1 From MS1, at node 17, since two links go into the same node and FF of K = 3,
FF of S = 0. Thus, INTF of S = 7.

14

11

13

15

FF = 0
INTF = 7
K

17

1.2 From MS2, links go into the same node have the same INTF.
Thus, INTF of K = 7, and TF of K = 10.

14

11

13

15

FF = 0
INTF = 7
K

17

INTF = 7
TF = 10

1.3 From MS3, activities in the activity chain have the same TF.
Thus, TF of K, G, and H are 10.
1.4 From MS1, FF of G and H = 0. INTF of G and H are 10.

14

11

G
TF = 10
FF = 0
INTF = 10

CEE536Example Problems

13

15

TF = 10
FF = 0
INTF = 10

27

FF = 0
INTF = 7
K

17

INTF = 7
TF = 10

P.G. Ioannou & C. Srisuwanrat

2.
2.1) MS1 (one link goes into one node, FF of the link = 0)
FF of A, B, C, and E= 0.
So, INTF of A and E = 0 and 4 respectively.
MS1 ( many links going to the same node, one of them must have zero FF )
FF of P = 0. Thus, INTF of P = 0. And also FF of R.
P

15
FF = 0

10

FF = 0
INTF = 0

25

30

FF = 0

FF = 0
INTF = 0

FF = 0
FF = 0
INTF = 4
20

2.2) MS2 ( many links going into the same have the same INTF)
INTF of U = INTF of P = 0. So, TF of U = 2.
P

15
FF = 0

A
FF = 0
INTF = 0

10

FF = 0
INTF = 0

25

FF = 0

30

INTF = 0
TF = 2
FFR = 0

FF = 0
INTF = 4
20

2.3) MS3 (activities on activity chain have the same TF)

TF of B = TF of A.
TF of R = TF of E. Then calculate INTF of R, which will give us INTF of D according MS2.
Thus, TF of D can be calculated.
TF of C = TF of P.
Note: up to this point, you should be able to get all the TF, FF, and also INTF. It should also be
mentioned that the given TF of A and P are not necessary. WHY???

CEE536Example Problems

28

P.G. Ioannou & C. Srisuwanrat

3. One link goes into one node FF = 0

Or Many links go into the same node at least one of the links must have FF = 0
TL = 32
TE = 32 INTFij = 26

TL = 27 from TLj-Tij
TE = 21 form TLi-INTFhi
T=5

TF = 8
FF = 2
INTFhi = 6

FF = 0 !
TF = 32 5- 21 = 6
INTF = 6

4.
4.1) Only one link goes into one node, we should be able to spot out activities whose FF = 0,
which are activities G, H, N, L, P, and S.
4.2) Many links go into the same node, at least one of them must have FF = 0. Thus, FF of
T=0

CEE536Example Problems

29

P.G. Ioannou & C. Srisuwanrat

4.3) Total float on activities on an activity chain have the same TF

Thus, we should be able to get TF of H and K (from Chain G-H-K), L and P (from Chain L-P-T).
FF = 0
TF = 4
INTF = 4
FF = 0
TF = 4
INTF = 4

11

G
FF = 0
INTF = 7

13

H
FF = 0
TF = 7
INTF = 7

15

19

17

23

25

FF = 0
TF = 4

29

FFK = 3
TF = 7
INTF = 4
FF = 0
INTF = 4

21

27

FF = 0
TF = 9

4.4) Activities going to the same node have the same INTF
Thus, we can calculate INTF of M and R (going to node 23), and U (going to node 29).
Note: INTF of M and R is TL23 TE23 (you should remember this by now)

CEE536Example Problems

30

P.G. Ioannou & C. Srisuwanrat

5. It is crucial to identify critical path, and knowing that any links going to the same node
have the same INTF.

FF =4
TF =1

INTF =3

FF =5

TF =0 !
TF =0 !
INTF = 0
TF =1
FF = 1
TF =1
FF = 0
FF = 0
TF = 3

CEE536Example Problems

FF = 0
TF = 4
INTF =3
FF = 0
TF = 3

FF =4
INTF = 0
TF = 4

TF =0 !

INTF = 0
TF = 3
FF = 3
FF =5
INTF = 0
TF = 5

31

P.G. Ioannou & C. Srisuwanrat

3. ACTIVITY-ON-NODE SCHEDULING

Problem 3.1
A. Construct a precedence diagram.
B. On the diagram, compute the four schedule dates (ESD, EFD, LSD, LFD) and the four floats (TF, FF, INTF, and IDF) for each
activity, and the lag for each link.
C. Identify the critical path

CEE536Example Problems

No

ACT

DUR

PREDECESSORS

5
10
15
20
25
30
35
40
45
50
55
60
65
70

B
M
N
Q
A
F
X
C
Y
S
J
T
V
U

5
4
9
15
1
4
9
9
9
6
5
10
5
10

B
B
B
M,N
N,Q
Q
Q
A,F,X
F
X,F
C
Y,S
V,T,J

33

P.G. Ioannou & C. Srisuwanrat

Problem 3.2
A. Construct a precedence diagram.
B. On the diagram, compute the four schedule dates (ESD, EFD, LSD, LFD) and the four floats (TF, FF, INTF, and IDF) for each
activity, and the lag for each link.
C. Identify the critical path

CEE536Example Problems

No

ACT

DUR

PREDECESSORS

5
10
15
20
25
30
35
40
45
50
55
60
65
70

A
B
C
P
L
M
Q
N
Y
F
J
S
V
Q1

1
8
4
7
2
4
4
9
5
10
2
2
5
1

A
A
A
B
C
P,C
P
L,Q
M
Q
N
Y,F,J
V,S

34

P.G. Ioannou & C. Srisuwanrat

Problem 3.3
A. Construct a precedence diagram.
B. On the diagram, compute the four schedule dates (ESD, EFD, LSD, LFD) and the four floats (TF, FF, INTF, and IDF) for each
activity, and the lag for each link.
C. Identify the critical path

CEE536Example Problems

No

ACT

DUR

PREDECESSORS

5
10
15
20
25
30
35
40
45
50
55
60
65
70

B
M
N
X
A
F
Q
C
Y
S
R
T
K
U

5
4
9
15
5
6
2
4
10
10
2
5
7
3

B
B
B
M,N
N,X
X
X
A
F,A
Q,F
C,Q
Y,S,R
K,T

35

P.G. Ioannou & C. Srisuwanrat

Problem 3.4
A. Construct a precedence diagram.
B. On the diagram, compute the four schedule dates (ESD, EFD, LSD, LFD) and the four floats (TF, FF, INTF, and IDF) for each
activity, and the lag for each link.
C. Identify the critical path

CEE536Example Problems

No

ACT

DUR

PREDECESSORS

5
10
15
20
25
30
35
40
45
50
55
60
65
70

A
B
C
P
L
F
Q
N
Y
T
R
S
V
U

9
1
10
10
2
10
8
6
7
4
9
1
10
1

A
A
A
B,C
C,P
P
P
L
F,L
F,Q
N,Q
Y,T,R
V,S

36

P.G. Ioannou & C. Srisuwanrat

Solution 3.1
5

9
10
M
4

24

28

5
B
5
0

0,0
0,0

14

28

16

11,0
11,0

25

20

25

0,0
0,0

5,0
5,0

20

29

29

24

24

20

0,0
0,0

20

29

32

29

29

CEE536Example Problems

4,0
4,0

38

30

38

8,8
0,3

43
65
V
5

38

34

38

0,0
0,0

43

43

55
J
5
29

38

29

29

40
C
9
24

0,0
0,0

50
S
6

35
X
9
20

38
45
Y
9

30
F
4

20
Q
15
5

14,14
0,0

20

15
N
9
5

29

25
A
1

19,5
14,5

15

14

9,9
0,9

53
70
U
10

43

43

0,0
0,0

53

39
60
T
10

33

33

37

4,4
0,0

43

P.G. Ioannou & C. Srisuwanrat

Solution 3.2
1

9
10
B
8

12

5
A
1
0

0,0
0,0

12

0,0
0,0

2,0
2,0

0,0
0,0

14

14

10

2,0
2,0

12

12

CEE536Example Problems

5,0
5,0

19

19

19

0,0
0,0

24
65
V
5

19

14

19

0,0
0,0

24

24

55
J
2
14

17

17

17

40
N
9
13

2,2
0,0

50
F
10

35
Q
4
10

17
45
Y
5

30
M
4

20
P
7
3

3,1
2,0

15
C
4
1

12

25
L
2

3,0
3,0

11

5,5
0,3

25
70
Q1
1

19

24

0,0
0,0

25

19
60
S
2

22

22

38

5,5
0,0

24

P.G. Ioannou & C. Srisuwanrat

Solution 3.3
5

9
10
M
4

17

21

5
B
5
0

0,0
0,0

14

21

11

6,0
6,0

20

20

20

0,0
0,0

0,0
0,0

20

26

26

26

26

32

12,2
10,2

20

26

26

22

26

CEE536Example Problems

14,0
14,0

36

36

36

0,0
0,0

43
65
K
7

36

28

36

0,0
0,0

43

43

55
R
2
34

34

24

24

40
C
4
34

7,0
7,0

50
S
10

35
Q
2
20

29
45
Y
10

30
F
6

20
X
15
5

7,0
7,0

20

15
N
9
5

19

25
A
5

12,5
7,5

19

14

8,8
0,0

46
70
U
3

36

43

0,0
0,0

46

29
60
T
5

38

38

39

14,14
0,0

43

P.G. Ioannou & C. Srisuwanrat

Solution 3.4
9

10
10
B
1

21

22

5
A
9
0

0,0
0,0

19

27

0,0
0,0

19

19

22

0,0
0,0

3,0
3,0

19

29

29

29

29

19

0,0
0,0

19

32

32

27

27

CEE536Example Problems

2,2
0,2

36

33

36

3,3
0,0

46
65
V
10

36

36

36

0,0
0,0

46

46

55
R
9
27

27

25

27

40
N
6
21

8,8
0,0

50
T
4

35
Q
8
19

28
45
Y
7

30
F
10

20
P
10
9

8,0
8,0

19

15
C
10
9

21

25
L
2

12,9
3,9

21

19

0,0
0,0

47
70
U
1

36

46

0,0
0,0

47

28
60
S
1

45

27

40

18,18
0,18

46

P.G. Ioannou & C. Srisuwanrat

Problem 3.5

CEE536Example Problems

41

P.G. Ioannou & C. Srisuwanrat

Problem 3.6

CEE536Example Problems

42

P.G. Ioannou & C. Srisuwanrat

Problem 3.7

CEE536Example Problems

43

P.G. Ioannou & C. Srisuwanrat

Problem 3.8

CEE536Example Problems

44

P.G. Ioannou & C. Srisuwanrat

Problem 3.9 (CalActivityOnNode)

CEE536Example Problems

45

P.G. Ioannou & C. Srisuwanrat

4. SCHEDULING USING A LINK MATRIX

Problem 4.1 Using matrix to calculate TF and FF

NO
5
10
15
20
25
30
35
40
45
50
55
60
65
70

ACT
A
B
C
Q
M
L
X
N
Z
S
J
T
V
Q1

DUR
4
5
3
8
1
8
2
7
8
8
6
4
10
6

PREDECESSORS
A
A
A
B,C
C,B,Q
Q,C
Q
M,L
L,M
X,L
N
Z,S,J
V,T

Problem 4.2 Using matrix to calculate TF and FF

NO
5
10
15
20
25
30
35
40
45
50
55
60
65
70

CEE536Example Problems

ACT
A
B
C
P
M
L
N
Y
G
S
R
T
K
Q1

DUR
7
5
7
5
1
5
2
9
5
9
2
5
9
5

47

PREDECESSORS
A
A
A
B,C
C,B,P
P,C
P
M,L
L,M,N
N
Y,N
G,S
K,T,R

P.G. Ioannou & C. Srisuwanrat

Problem 4.3 Using matrix to calculate TF and FF

NO
5
10
15
20
25
30
35
40
45
50
55
60
65
70

CEE536Example Problems

ACT
A
B
C
Q
L
F
X
N
Y
T
J
S
V
U

DUR
10
9
7
9
1
5
4
7
6
9
3
6
10
8

48

PREDECESSORS
A
A
A
B
C
Q,C
Q
L
F,L
X,F,N
N,X
Y,T,J
V,S

P.G. Ioannou & C. Srisuwanrat

Solution 4.1
SUC
DUR
ESD
FF

A
4
0
0

TF

0
FF
TF

B
5
4
0
--3
0
3
FF
TF

C
3
4
0
--5

Q
8
4
0
--0

2
5
FF
TF

M
1
9

L
8
12

0
--10
2
--12

3
--3
5
--5
0
--0

0
0
FF
TF

X
2
12

N
7
12

TF

5
--13
0
--8

TF

J
6
20

T
4
19

Q1
6
38

0
--15

EFD
A
4

Q
12
10
--10
0
--0

10
--10
0
--0

6
8
FF
TF

M
10
0
--2
6
--8

0
15
FF
TF

L
20
X
14
0
--15

0
0
FF
TF

0
FF

2
2
FF
TF

15
15
FF
TF

49

N
19
0
--0
0
--0
2
--2

TF

CEE536Example Problems

V
10
28

C
7

0
0
FF

S
8
20

B
9

10
10
FF

Z
8
20

Z
28
S
28
J
26

0
FF

15
--15
0
--0
0

TF

T
23
V
38
Q1
44

P.G. Ioannou & C. Srisuwanrat

Solution 4.2
DUR
ESD
FF
TF

A
7
0
0
0
FF
TF

B
5
7
0
--2
2
2
FF
TF

C
7
7
0
--0

P
5
7
0
--2

0
0
FF
TF

M
1
14

L
5
14

2
--6
0
--4

2
--2
0
--0
2
--2

0
2
FF
TF

N
2
14

Y
9
12

TF

0
--3
2
--5

TF

R
2
16

T
5
21

Q1
5
37

0
--11

EFD
A
7

P
12
4
--8
0
--4

0
3
FF
TF

4
--4
0
--0
3
--3

M
15
L
19
0
--19

0
11
FF
TF

5
--16
0
--11

4
4
FF
TF

0
FF

Y
21

19
19
FF
TF

11
FF

G
24
S
28

0
FF

19
--19
11
--11
0
--0
0

TF

11

TF

50

N
16

4
--4
0
--0

TF

CEE536Example Problems

K
9
28

C
14

0
0
FF

S
9
19

B
12

4
4
FF

G
5
19

R
18
T
26
K
37
Q1
42

P.G. Ioannou & C. Srisuwanrat

Solution 4.3
DUR
ESD
FF
TF

A
10
0
0
FF
TF

B
9
10
0
--2
0
2
FF
TF

C
7
10
0
--0

Q
9
10
0
--2

L
1
19

F
5
17

X
4
19

N
7
19

Y
6
20

T
9
22

J
3
26

S
6
26

U
8
41

0
--2
0
0
FF
TF

0
2
FF

2
--7
0
--5

C
17
0
--2

0
2
FF
TF

EFD
A
10
B
19

0
--0

TF

Q
19
0
--5

0
0
FF
TF

2
--2
0
--0

3
5
FF
TF

0
2
FF
TF

L
20
4
--6
3
--5
0
--2

F
22
3
--12
0
--9

5
5
FF
TF

0
FF

2
2
FF
TF

N
26

9
9
FF
TF

51

X
23

5
--5
0
--0
2
--2

TF

CEE536Example Problems

V
10
31

Y
26
T
31
J
29

0
FF

9
--9
0
--0
0

TF

S
32
V
41
U
49

P.G. Ioannou & C. Srisuwanrat

5. PROJECT UPDATING

Project Updating
Original Target Schedule

A-3

B-8

E-6

G-4

C-5

F-3

H-6

K-3

D-3

Update Information at data date = 10.

1. Activity D takes 6 days to finish.
2. Activity F takes 5 more days to complete.
3. It is expected that it will take total 15 days to finish activity B.
4. Activity H cannot start until date 17 because of the delay of material.
3

10
B1-7

10

F1-2

C-5

A-3

10

10

Dummy

9
D-6

Please study these two networks and pay attention to on-processing activities (B and F).
10

18
B2-8

10

10

Dummy

10

15
F2-5

CEE536Example Problems

G-4

E-6

15

17
Waiting
Dummy

17

23
H-6

53

K-3

P.G. Ioannou & C. Srisuwanrat

6. PERTPNET

6. Probabilistic Scheduling using PERT and PNET

Problem 6.1 Probabilistic scheduling using PERT and PNET methods
1.) Set up a table and calculate Early Event Times (TE), Late Event Times (TL), Activity
Free Slack (AFS), and Activity Total Slack (ATS).
2.) Determine the PERT "critical path(s)" and the mean and standard deviation for the
project duration.
3.) Use PNET method to find the project durations and their corresponding probabilities
of project completion from 0 to 100%.

i
5
5
5
5
10
10
15
15
20
20
25
30
35
40
45
50

CEE536Example Problems

j
10
15
20
25
30
35
35
45
40
45
45
50
50
50
55
55

Act
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
Z

a
5.00
4.50
6.00
4.00
2.50
4.00
6.50
4.00
2.50
4.00
2.50
1.00
3.50
4.00
4.50
4.00

55

M
7.00
5.00
8.00
6.00
3.50
6.00
8.00
5.00
3.50
6.00
4.00
2.00
4.50
6.00
5.00
6.00

b
9.50
7.00
10.50
7.50
5.00
8.00
11.00
7.00
4.50
7.00
5.50
3.00
6.50
8.00
7.00
9.00

P.G. Ioannou & C. Srisuwanrat

Problem 6.2 Probabilistic scheduling using PERT and PNET methods

1.) Set up a table and calculate Early Event Times (TE), Late Event Times (TL), Activity
Free Slack (AFS), and Activity Total Slack (ATS).
2.) Determine the PERT "critical path(s)" and the mean and standard deviation for the
project duration.
3.) Use PNET method to find the project durations and their corresponding probabilities
of project completion from 0 to 100%.
i
5
5
5
10
10
15
20
25
25
30
35
40
45
50
55
60

CEE536Example Problems

j
10
15
30
20
25
30
35
35
40
45
50
50
55
60
60
65

Act
A
B
C
Y
U
I
O
P
L
K
J
H
G
F
D
S

a
2.00
6.00
1.00
2.50
5.00
3.00
2.50
2.00
3.00
1.00
5.00
4.00
2.00
6.50
3.50
3.00

56

M
4.00
7.00
2.00
4.50
6.00
4.00
5.50
3.00
4.00
2.00
6.50
5.00
3.00
7.50
5.00
4.00

b
6.50
7.50
5.50
5.50
7.00
7.50
8.00
5.00
4.00
3.50
8.00
6.50
5.00
9.50
7.00
4.50

P.G. Ioannou & C. Srisuwanrat

Problem 6.3 Probabilistic scheduling using PERT and PNET methods

1.) Set up a table and calculate Early Event Times (TE), Late Event Times (TL), Activity
Free Slack (AFS), and Activity Total Slack (ATS).
2.) Determine the PERT "critical path(s)" and the mean and standard deviation for the
project duration.
3.) Use PNET method to find the project durations and their corresponding probabilities
of project completion from 0 to 100%.
i

Act

10

3.00

5.00

9.00

15

5.00

6.00

8.00

10

20

5.00

6.00

7.00

10

25

3.00

4.00

7.00

15

25

0.00

0.00

0.00

15

30

4.00

7.00

9.00

20

35

2.00

3.00

4.00

25

35

4.00

6.00

11.00

30

35

0.00

0.00

0.00

30

40

5.00

6.00

9.00

35

45

1.00

3.00

5.00

40

45

3.00

6.00

7.00

CEE536Example Problems

57

P.G. Ioannou & C. Srisuwanrat

Solution 6.1
Step 1. Calculate E[ti], SD[ti], and Var[ti].
i
5
5
5
5
10
10
15
15
20
20
25
30
35
40
45
50

Table 1. Activity Properties

j Act
a
M
b
E[ti] SD[ti] Var[ti] TEi TEi+E[ti] TLi-E[ti] TLj ATS
10 A 5.00 7.00 9.50 7.08 0.75
0.56
0
7.08
0.42
7.5 0.42
15 B 4.50 5.00 7.00 5.25 0.42
0.18
0
5.25
0
5.25
0
20 C 6.00 8.00 10.50 8.08 0.75
0.56
0
8.08
0.42
8.5 0.42
25 D 4.00 6.00 7.50 5.92 0.58
0.34
0
5.92
8.83
14.75 8.83
30 E 2.50 3.50 5.00 3.58 0.42
0.18
7.08
10.66
12.25
15.83 5.17
35 F 4.00 6.00 8.00
6
0.67
0.45
7.08
13.08
7.5
13.5 0.42
35 G 6.50 8.00 11.00 8.25 0.75
0.56
5.25
13.5
5.25
13.5
0
45 H 4.00 5.00 7.00 5.17
0.5
0.25
5.25
10.42
13.58
18.75 8.33
40 I 2.50 3.50 4.50 3.33 0.33
0.11
8.08
11.41
8.5
11.83 0.42
45 J 4.00 6.00 7.00 5.83
0.5
0.25
8.08
13.91
12.92
18.75 4.84
45 K 2.50 4.00 5.50
4
0.5
0.25
5.92
9.92
14.75
18.75 8.83
50 L 1.00 2.00 3.00
2
0.33
0.11
10.66
12.66
15.83
17.83 5.17
50 M 3.50 4.50 6.50 4.33 0.33
0.11
13.5
17.83
13.5
17.83
0
50 N 4.00 6.00 8.00
6
0.67
0.45 11.41
17.41
11.83
17.83 0.42
55 O 4.50 5.00 7.00 5.25 0.42
0.18 13.91
19.16
18.75
24
4.84
55 Z 4.00 6.00 9.00 6.17 0.83
0.69
17.83
24
17.83
24
0

AFS
0
0
0
0
0
0.42
0
3.49
0
0
3.99
5.17
0
0.42
4.84
0

E[ti] = (a+4M+b)/6
SD[ti] = (b-a)/6 => Var[ti] = SD[ti]2

CEE536Example Problems

58

P.G. Ioannou & C. Srisuwanrat

Step 2. Determine all possible paths and calculate their E[T], Var[T], and SD[T]
Table 2. Path Properties
i
1
2
3
4
5
6
7
Example:

path
5 - 15 - 35 - 50 - 55
5 - 20 - 40 - 50 - 55
5 - 10 - 35 - 50 - 55
5 - 20 - 45 - 55
5 - 10 - 30 - 50 - 55
5 - 15 - 45 - 55
5 - 25 - 45 - 55

E[Ti]

Var[Ti]

SD[Ti]

24.00
23.58
23.58
19.16
18.83
15.67
15.17
24.00

1.54
1.81
1.81
0.99
1.54
0.61
0.77

1.24
1.35
1.35
0.99
1.24
0.78
0.88

E[Ti]
+3SD[Ti]
3SD[Ti]
20.28
27.72
19.53
27.63
19.53
27.63
16.19
22.13
15.11
22.55
13.33
18.01
12.53
17.81
20.28
27.72

Path 1 consists of activities 5-15, 15-35, 35-50, and 50-55.

Activity =>
E[ti]
Var[ti]

5-15
5.25
0.18

15-35
8.25
0.56

35-50
4.33
0.11

50-55
6.17
0.69

E[T1] = 24
Var[T1] = 1.54

Thus, SD[T1] of path1 is 1.540.5 = 1.24

NOTE:
1. Do not add SD[ti] of activities to get SD[T] of a path. Path SD[T] must be derived from a square root of the summation of Var[ti]
of activities in the path.
2. Path 6 and 7 can be neglected because their E[Ti]+3SD[Ti], which are 18.01 and 17.81, are relatively short compared to the
maximum E[T]-3SD[T], which is 20.28.
3. Paths in Table 2 must be sorted by E[T] before constructing Table 3, otherwise you might represent a longer path by a shorter one.

CEE536Example Problems

59

P.G. Ioannou & C. Srisuwanrat

Step 3. Calculate correlation between paths

Table 3. Correlations between paths
r 1 2 Pij
r 1 3 Pij
r 1 4 Pij
r 1 5 Pij
r 1 6 Pij
r 1 7 Pij
r 2 3 Pij
r 2 4 Pij
r 2 5 Pij
r 2 6 Pij
r 2 7 Pij
r 3 4 Pij
r 3 5 Pij
r 3 6 Pij
r 3 7 Pij
r 4 6 Pij
r 4 7 Pij
r 6 7 Pij

0.41
0.48
0
0.45
0.18
0
0.38
0.42
0.41
0
0
0
0.75
0
0
0.23
0.2
0.26

ij =

( )

2
k

Ti Tj

k ( i j )

Correlation greater
than 0.5, thus
eliminate path 5

ij

is the correlation between path i and j.

are activities that are in both path i and j.

Ti

is standard deviation of path i, SD[Ti]

Tj

is standard deviation of path j, SD[Tj]

Example: Path 1 and 2 have activities 50-55 in common (its SD[ti] is 0.83), and their SD[T] are
1.24 and 1.35. Thus,

ij =

( )

2
k

Ti Tj

0.832
= 12 =
= 0.412
1.24 1.35

NOTE:
1. Paths in Table 2 must be sorted by E[T] before constructing Table 3, otherwise you might represent a longer path by shorter
one.
2. Path 5 is represented by path 3. ( A shorter path with high correlation to a longer path is represented by the longer one, NOT
the other way around)

CEE536Example Problems

60

P.G. Ioannou & C. Srisuwanrat

Step 4. Calculate probabilities of project completion

Table 4. Probability of Project Completion
T

19
20
21
22
23
24
25
26
27
28
29

1
(PERT)
0.000
0.001
0.008
0.053
0.210
0.500
0.790
0.947
0.992
0.999
1.000

0.000
0.004
0.028
0.121
0.334
0.622
0.854
0.963
0.994
0.999
1.000

0.000
0.004
0.028
0.121
0.334
0.622
0.854
0.963
0.994
0.999
1.000

0.436
0.802
0.968
0.998
1.000
1.000
1.000
1.000
1.000
1.000
1.000

1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000

1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000

all combine
(PNET)
0.000
0.000
0.000
0.001
0.023
0.194
0.576
0.879
0.981
0.998
1.000

x E[Ti ]

Fi ( x) = Fu

Example:

26 24
Probability of finishing the project less than 26 days according to path 1 is F1 (26) = Fu
= Fu (1.61) = 0.946
1.24
Probability of finishing the project less than 19 days according to path 1 is
19 24
F1 (19) = Fu
= Fu (4) = 1 Fu (4) = 1 0.99997 0
1.24
Probability of finishing the project greater that 26 days is 1-F1(26) = 1- 0.946 = 0.54
NOTE:
As shown in Table 4, path 6 and 7 can be ignored since their E[Ti]+3SD[Ti] (from Table 2), which are 18.01 and 17.81
respectively ,are less than the maximum E[Ti]-3SD[Ti], 20.28. In Table 4, agreeing to Table 2, probabilities of path 6 and 7 are all
equal to 1.

CEE536Example Problems

61

P.G. Ioannou & C. Srisuwanrat

Probability of Project Completion

1.000
0.900
0.800
Probability

0.700
0.600
PERT

0.500

PNET

0.400
0.300
0.200
0.100
0.000
19

20

21

22

23

24

25

26

27

28

29

Day

CEE536Example Problems

62

P.G. Ioannou & C. Srisuwanrat

Solution 6.2
Step 1. Calculate E[ti], SD[ti], and Var[ti].
Table 1. Activity Properties
i
j Act
a
M
b
E[ti] SD[ti] Var[ti] TEi TEi+E[ti] TLi-E[ti] TLj ATS
5 10 A 2.00 4.00 6.50 4.08 0.75
0.56
0
4.08
0
4.08
0
5 15 B 6.00 7.00 7.50 6.92 0.25
0.06
0
6.92
6.74
13.66 6.74
5 30 C 1.00 2.00 5.50 2.33 0.67
0.45
0
2.33
15.5
17.83 15.5
10 20 Y 2.50 4.50 5.50 4.25 0.58
0.34
4.08
8.33
4.08
8.33
0
10 25 U 5.00 6.00 7.00
6
0.33
0.11
4.08
10.08
4.58
10.58 0.5
15 30 I 3.00 4.00 7.50 4.17
0.5
0.25
6.92
11.09
13.66
17.83 6.74
20 35 O 2.50 5.50 8.00 5.42 0.92
0.85
8.33
13.75
8.33
13.75
0
25 35 P 2.00 3.00 5.00 3.17
0.5
0.25 10.08
13.25
10.58
13.75 0.5
25 40 L 3.00 4.00 4.00 3.83 0.17
0.03 10.08
13.91
11.67
15.5 1.59
30 45 K 1.00 2.00 3.50 2.08 0.42
0.18 11.09
13.17
17.83
19.91 6.74
35 50 J 5.00 6.50 8.00 6.83 0.83
0.69 13.75
20.58
13.75
20.58
0
40 50 H 4.00 5.00 6.50 5.08 0.42
0.18 13.91
18.99
15.5
20.58 1.59
45 55 G 2.00 3.00 5.00 3.17
0.5
0.25 13.17
16.34
19.91
23.08 6.74
50 60 F 6.50 7.50 9.50 7.58 0.58
0.34 20.58
28.16
20.58
28.16
0
55 60 D 3.50 5.00 7.00 5.08 0.58
0.34 16.34
21.42
23.08
28.16 6.74
60 65 S 3.00 4.00 4.50 3.92 0.25
0.06 28.16
32.08
28.16
32.08
0
Step 2. Determine all possible paths and calculate their E[T], Var[T], and SD[T]

AFS
0
0
8.76
0
0
0
0
0.5
0
0
0
1.59
0
0
6.74
0

Table 2. Path Properties

i
1
2
3
4
5

CEE536Example Problems

path

5 - 10 - 20 - 35 - 50 - 60 - 65
5 - 10 - 25 - 35 - 50 - 60 - 65
5 - 10 - 25 - 40 - 50 - 60 - 65
5 - 15 - 30 - 45 - 55 - 60 - 65
5 - 30 - 45 - 55 - 60 - 65

E[Ti]
32.08
31.58
30.49
25.34
16.58
32.08

63

Var[Ti] SD[Ti]
2.84
1.69
2.01
1.42
1.28
1.13
1.14
1.07
1.28
1.13

E[Ti]
-3SD[Ti] +3SD[Ti]
27.01
37.15
27.32
35.84
27.1
33.88
22.13
28.55
13.19
19.97
27.32
37.15

P.G. Ioannou & C. Srisuwanrat

Step 3. Calculate correlation between paths

Step 4. Calculate probabilities of project completion

Table 3. Correlations between paths

r 1 2 Pij
r 1 3 Pij
r 1 4 Pij
r 1 5 Pij
r 3 4 Pij
r 3 5 Pij
r 4 5 Pij

CEE536Example Problems

Table 4. Probability of Project Completion

0.69
0.5
0.03
0.03
0.05
0.05
0.68

64

1
(PERT)

26
27
28
29
30
31
32
33
34
35
36
37
38

0.000
0.001
0.008
0.034
0.109
0.261
0.481
0.707
0.872
0.958
0.990
0.998
1.000

0.000
0.001
0.014
0.094
0.332
0.674
0.909
0.987
0.999
1.000
1.000
1.000
1.000

0.731
0.940
0.994
1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000
1.000

all
combine
(PNET)
0.000
0.000
0.000
0.003
0.036
0.176
0.437
0.698
0.871
0.958
0.990
0.998
1.000

P.G. Ioannou & C. Srisuwanrat

Problem 6.3
i
5
5
10
10
15
15
20
25
30
30
35
40

Table 1.
j Act
a
M
b
E[ti] SD[ti] Var[ti] TEi TEi+E[ti] TLi-E[ti] TLj ATS
10 S 3.00 5.00 9.00 5.33
1
1
0
5.33
5.84
11.17 5.84
15 U 5.00 6.00 8.00 6.17
0.5
0.25
0
6.17
0
6.17
0
20 P 5.00 6.00 7.00
6
0.33
0.11
5.33
11.33
13
19
7.67
25 E 3.00 4.00 7.00 4.33 0.67
0.45
5.33
9.66
11.17
15.5 5.84
25 R 0.00 0.00 0.00
0
0
0
6.17
6.17
15.5
15.5 9.33
30 W 4.00 7.00 9.00 6.83 0.83
0.69
6.17
13
6.17
13
0
35 O 2.00 3.00 4.00
3
0.33
0.11 11.33
14.33
19
22
7.67
35 M 4.00 6.00 11.00 6.5
1.17
1.37
9.66
16.16
15.5
22
5.84
35 A 0.00 0.00 0.00
0
0
0
13
13
22
22
9
40 N 5.00 6.00 9.00 6.33 0.67
0.45
13
19.33
13
19.33
0
45 X 1.00 3.00 5.00
3
0.67
0.45 16.16
19.16
22
25
5.84
45 Y 3.00 6.00 7.00 5.67 0.67
0.45 19.33
25
19.33
25
0

AFS
0
0
0
0
3.49
0
1.83
0
3.16
0
5.84
0

Table 2.
i
1
2
3
4*
5*

PATH
5 - 15 - 30 - 40 - 45
5 - 10 - 25 - 35 - 45
5 - 10 - 20 - 35 - 45
5 - 15 - 30 - 35 - 45
5 - 15 - 25 - 35 - 45

E[Ti]
25.00
19.16
17.33
16.00
15.67
25.00

E[Ti]
Var[Ti] SD[Ti] -3SD[Ti] +3SD[Ti]
1.84
1.36
20.92
29.08
3.27
1.81
13.73
24.59
1.67
1.29
13.46
21.20
1.39
1.18
12.46
19.54
2.07
1.44
11.35
19.99
20.92
29.08

NOTE:
1. Data in Table 2 must be sorted by E[T] before constructing Table 3, otherwise you might try to represent a longer path by
shorter one.
2. Path 4 and 5 can be ignored since their E[Ti]+3SD[Ti], which are 19.54 and 19.99 respectively ,are less than the maximum
E[Ti]-3SD[Ti] , 20.92.

CEE536Example Problems

65

P.G. Ioannou & C. Srisuwanrat

Table 3.
r 1 2 Pij
r 1 3 Pij
r 1 4 Pij
r 1 5 Pij
r 2 3 Pij
r 2 5 Pij

Table 4.

0.00
0.00
0.59
0.13
0.62
0.70

1
(PERT)

20
21
22
23
24
25
26
27
28
29
30

0.000
0.002
0.014
0.071
0.231
0.500
0.769
0.929
0.986
0.998
1.000

0.679
0.845
0.942
0.983
0.996
0.999
1.000
1.000
1.000
1.000
1.000

all
combine
(PNET)
0.000
0.001
0.013
0.070
0.230
0.500
0.769
0.929
0.986
0.998
1.000

NOTE:
Path 4 can be represented by path 1, and also path 3 can be represented by path 2. ( A shorter path with high correlation to a longer
path is represented by the longer one, NOT the other way around)

CEE536Example Problems

66

P.G. Ioannou & C. Srisuwanrat

7. TIME-COST TRADEOFF TABLES

Time-Cost Tradeoff

The following is a basic idea about Time-Cost Tradeoff. Read it carefully and think along
the way will give you an insight idea about this subject.
If the minimum duration of B is 1 day (TC=1), and cost of shortening its duration is $200 per 1
shortened day, how many days will you shorten activity B?

1) Shortening activity B by 1 day costs $200 and reduces project duration to 11 days.

CEE536Example Problems

68

P.G. Ioannou & C. Srisuwanrat

2) Shortening activity B by 2 days costs $400 and reduces project duration to 10 days.

As shown in the case of shortening B by 2 days, one of the lags, between C and D,
becomes 0, because shortening B allows D to start earlier. As a result, the network now has 2
critical paths. Accordingly, shortening activity B alone from this point does not reduce project
duration because another critical path A-C-D still control the project duration (10 days). So, if
you want to shorten B beyond this point, you have to shorten activity C as well.
It should be noted that when one of the lags becomes 0 due to shortening an activity, it is
not necessary that the new 0 lag link will incur a new critical path. However, it is a good practice
to stop shortening an activity at the point when one of the lags becomes 0, because we do not
know whether there is a new critical path or not.
3) Shorten activity B by 3 days costs $600 and project duration is still the same as shortening B
by 2 days.

CEE536Example Problems

69

P.G. Ioannou & C. Srisuwanrat

What happens here is after shorten B by 2 days, path A-B-D and path A-C-D become
critical paths. Shortening B further (the 3rd day) cannot reduce project duration because
ANOTHER CRITICAL PATH (A-C-D) still dominates the project duration. This means the
$200 that is spent on the 3rd shortened day is wasted, since we do not gain any reduction in
project duration from the last $200.
2) What will you do if you have the following options? And in which orders?

Activity A can be crashed to 3 days by paying extra $140 per 1 shorten day.

Activity B can be crashed to 1 day by paying extra $110 per 1 shorten day.

Activity C can be crashed to 3 days by paying extra $40 per 1 shorten day.

Activity D can be crashed to 1 day by paying extra $20 per 1 shorten day.

Activity E can be crashed to 1 day by paying extra $100 per 1 shorten day.

Procedure

First, select a critical activity with the cheapest $/shortened day. (If you dont know why we
select a critical activity, I suggest you to read the BABY problem again. Please make sure you
are sober this time.)
Second, shorten the selected activity until one of the lags in the network becomes 0.
Thus,

CEE536Example Problems

70

P.G. Ioannou & C. Srisuwanrat

Step 1 (or Cycle 1)

Shorten E by 1 day. There is no change in lags. Project duration becomes 12 days.

Step 2 (or Cycle 2)

Select activity B because it is a critical activity with the cheapest shortening cost ($110).
At this step, we will shorten B by 1 day only because lag C-E will become 0.

CEE536Example Problems

71

P.G. Ioannou & C. Srisuwanrat

As shown in the figure above, after shorten B, the network now has 2 critical paths, A-B-E and
A-C-E.
Step 3 (or Cycle 3)
At this step, we have 2 choices:
1) Shorten activity A alone for $140/shortened day.
2) Shorten activities B and C together for $110 + $40 = $150/shortened day.
If you shorten either B or C alone, you are going to waste your money because project duration
will remain the same.
Thus, we choose the cheaper one between the two choices, which is shortening activity A by 3
days.

Step 4 (or cycle 4)

We have to shorten B and C at the same time. WHY???

Otherwise, project duration will still be the same, which means you spend more money
on the project without gaining any reduction in project duration.
Network limit is 2 days. WHY???
Lag D-E will become 0.
Although network limit is 2 days, we can only shorten B and C by 1 day in this cycle. WHY???
TC of activity C is 3 days.
At this point, you have an idea about time-cost tradeoff. In the next section, we will talk about
how to do this in a more systematic manner by using table.

CEE536Example Problems

72

P.G. Ioannou & C. Srisuwanrat

Example from the previous problem by using table to check network limit and update lags.
IMPORTANT: Column i refers to the finish date of activity, whereas column j refers to the
start date of activity!!! (this is really important.)
I skip cycle 1 because it is easy. In cycle2, we decide to shorten activity B because it is the
cheapest critical activity.

CYCLE

2.1

2.2

2.3

ACTS Changed

Network Limit

Days Changed

Lag

Lag

10

15

10

20

10

25

15

30

20

30

<

25

30

<

<<

<<

<

Lag

<<

<

Lag

In cycle 2.1, we identify the being shortened activity B by putting double arrow "<<" in this
cycle 2.
In cycle 2.2, since the lag 15-30 is 0, we assume that finish date of B (or column i of B) controls
the start date of E (or column j of E). Thus, shortening the finish date of B (or moving the finish
date forward) will move the start date of E forward too!! Accordingly, we put an arrow for
column j of E.
In cycle 2.3, since there are 3 cells in column j of E, which refers to the same thing (start date of
E), we need to put an arrow for each one of them.

CEE536Example Problems

73

P.G. Ioannou & C. Srisuwanrat

Now lets focus on one particular lag.

Part of the above table focus on lag 20-30 from cycle 2.3.
i

Lag

20

30

Lag

Lag

Lag

<

This unpaired arrow in cycle 2.3 on lag 20-30 means

1) The finish date of 20 will not be moved forward since there is no arrow in the column i of 20.
2) The start date of 30 (column j of 30) will be moved forward.
3) While keeping the finish date of 20 the same and moving the start date of 30 forward, we can
only move start date of 30 forward by 1 day only because lag 20-30 will become 0. And this 1
day is the network limit for cycle 2.

Lets see if you understand the underlying idea of the table and arrow.
What do these following parts of time-cost tradeoff table mean?
Lag i j
3 < <
The finish date of activity i and the start date of activity j are moved forward for the same
amount. Thus, the lag between them is still the same.
Lag i j
2 <
The finish date of act i is moved forward while the start date of j is still the same. Thus, the lag
will increase.
Lag i j
0
<
The start date of activity j is moved forward while the finish date of i is still the same. Since the
lag between them is 0, this is IMPOSSIBLE. You have to CROSS the arrow for activity j out,
indicating that it cannot be moved. We will talk about this again later in the following example.

CEE536Example Problems

74

P.G. Ioannou & C. Srisuwanrat

SETUP TABLE
T

10

600

300

20

800

650

30

480

240

40

300

100

50

1600

1000

60

1150

1100

70

500

300

sum

5430

3690

20
B
2

12
40
D
3

4
10
A
4

CN

30
C
5

CC

TN

TC

ID

10
50
E
4

12
2

15

70
G
3

11
60
F
2

TALLY OF CRITICAL PATH

STEP

ACTIVITIES

10

20,30

40,50,60

70

CEE536Example Problems

75

P.G. Ioannou & C. Srisuwanrat

ACTIVITY SELECTION AND TALLY TABLE

ACT

Slope

60

50

40

100

30

120

10

150

20

150

70

200

50

300

NETWORK LIMIT DETERMINATION TABLE

CYCLE
ACTS Changed
Network Limit
Days Changed
i

Lag

10

20

10

30

20

40

20

50

30

40

30

60

40

70

50

70

60

70

Cycle 1

CEE536Example Problems

76

P.G. Ioannou & C. Srisuwanrat

4
T

10

600

300

20

800

650

30

480

240

40

300

100

50

1600

1000

60

1150

1100

70

500

300

sum

5430

3690

20
B
2

40
D
3

4
10
A
4

CN

30
C
5

CC

TN

12

TC

ID

10
50
E
4

12
2

15

70
G
3

11
60
F
2

TALLY OF CRITICAL PATH

STEP

ACTIVITIES

10

10

20,30

30

40,50,60

40

70

70

CEE536Example Problems

77

P.G. Ioannou & C. Srisuwanrat

ACTIVITY SELECTION AND TALLY TABLE

40

100

30

120

10

150

20

150

70

200

50

300

x
x
x
200

50

100

60

240

Slope

300

ACT

NETWORK LIMIT DETERMINATION TABLE

CYCLE

1.1

1.2

1.3

1.4

ACTS Changed

40

40

40

40
1

Network Limit

Days Changed
i

Lag

10

20

10

30

20

40

20

50

30

40

30

60

40

70

50

70

<

<

60

70

<

<

<<

Lag

<<

<

<<

<

<<

<
This is the network limit.

Cycle 2

CEE536Example Problems

78

P.G. Ioannou & C. Srisuwanrat

10

600

300

20

800

650

30

480

240

40

300

100

50

1600

1000

60

1150

1100

70

500

300

20
B
2

40
D
2

4
10
A
4

30
C
5

50
E
4

11
1

sum 5430 3690 3790

Current Project Cost =3690 + 100 = $3790
at 14 days with 2 critical paths

10

14
70
G
3

CN

CC

TN

11

TC

ID

11
60
F
2

TALLY OF CRITICAL PATH

STEP

ACTIVITIES

10

10

10

10

20,30

30

30

30

40,50,60

40

40

60

70

70

70

70

CEE536Example Problems

79

P.G. Ioannou & C. Srisuwanrat

ACTIVITY SELECTION AND TALLY TABLE

10

150

20

150

70

200

50

300

x
x

x
x

x
200

120

150

30

120

100

150

40

200

50

100

60

240

Slope

300

ACT

NETWORK LIMIT DETERMINATION TABLE

CYCLE

2.1

2.2

2.3

2.4

2.5

2.6

2.7

ACTS Changed

40

30

30

30

30

30

30

30

Network Limit

Days Changed
i

Lag

Lag

Lag

10

20

10

30

20

40

20

50

30

40

<<

<<

30

60

<<

<<

40

70

50

70

<

60

70

<

Lag

Lag

<

<<

<

<

<<

<

Lag

<

Lag

<

Lag

<

Lag

<

<<

<

<<

<

<<

<

<<

<

<<

<<

<

<<

<

<<

<

<<

<

<

<

<

<

<

<

<

<
<

<

<

<

Cycle 3

CEE536Example Problems

80

P.G. Ioannou & C. Srisuwanrat

10

600

300

20

800

650

30

480

240

40

300

100

50

1600

1000

60

1150

1100

70

500

300

20
B
2
0

4
10
A
4

40
D
2

30
C
4

50
E
4

10
0

sum 5430 3690 3910

Current Project Cost = 3790 + 120 = 3910
at 14 days with 3 critical paths

10

13
70
G
3

CN

CC

10

TN

TC

ID

10
60
F
2

TALLY OF CRITICAL PATH

STEP

ACTIVITIES

10

10

10

10

10

10

10

20,30

30

30

30

30

30

20

40,50,60

40

40

60

40

60

50

70

70

70

70

70

70

70

CEE536Example Problems

81

P.G. Ioannou & C. Srisuwanrat

Combinations for cycle 3

1)

4)

7)

Activity 10

2)

Activities 20 and 30

3)

Activities 40,50, and 60

10

10

10

10

10

10

10

10

10

30

30

20

30

30

20

30

30

20

40

60

50

40

60

50

40

60

50

70

70

70

70

70

70

70

70

70

Activity 70

5)

Activities 30 and 50

6)

Activities 20,40, and 60

10

10

10

10

10

10

10

10

10

30

30

20

30

30

20

30

30

20

40

60

50

40

60

50

40

60

50

70

70

70

70

70

70

70

70

70

Activities 10 and 20

8)

Activities 30 and 40

9)

Activities 40 and 50

10

10

10

10

10

10

10

10

10

30

30

20

30

30

20

30

30

20

40

60

50

40

60

50

40

60

50

70

70

70

70

70

70

70

70

70

Combinations 1 to 4 are considered as the obvious combinations, since you just pick critical activities from each sequence step.
Combinations 5 and 6 are a little bit harder to spot. However, if you study the network carefully, you should be able to identify them.
Combination 7 cannot be used since it will shorten 2 critical activities (10 and 20) on the same critical path (3rd path) twice.
Combination 8 cannot be used since it will shorten 2 critical activities (30 and 40) on the same critical path (1st path) twice. Moreover,
it does not shorten the 3rd critical path.
Combination 9 cannot be used since it does not shorten any critical activity on the 2nd critical path.

CEE536Example Problems

82

P.G. Ioannou & C. Srisuwanrat

ACTIVITY SELECTION AND TALLY TABLE

300

x
x

x
x

x
x

x
x

x
300

50

420

200

x
x

200

70

450

150

270

20

150

150

200

10

150

120

120

100

30

300

40

150

50

200

60

100

Slope

240

ACT

NETWORK LIMIT DETERMINATION TABLE

CYCLE

ACTS Changed

40

30

10

Network Limit

none

Days Changed

Lag

10

20

10
20

Lag

<<

<

30

<<

<

40

<

Lag

<

<

<

<

20

50

30

40

<<

<

<

<

30

60

<<

<

<

<

40

70

<

<

<

<

50

70

<

<

<

60

70

<

<

<

<<

<

<
<

<

Lag

Network limit is none because shortening activity 10 does not reduce any of the lags.
Can you tell why?
If you study the arrow head in the above table from cycle 1, 2, and this cycle 3
carefully, you will see there is no unpaired arrow in i and j columns in cycle 3.

Cycle 4

CEE536Example Problems

83

P.G. Ioannou & C. Srisuwanrat

10

600

300

20

800

650

30

480

240

40

300

100

50

1600

1000

60

1150

1100

70

500

300

20
B
2
0

10
A
2

40
D
2

30
C
4

50
E
4

8
0

sum 5430 3690 4210

Project Cost = 3910 + 2 x 150 = 4210
at 14 days with 3 critical paths.
Activity A cannot be crashed anymore.

11
70
G
3

CN

CC

TN

TC

ID

8
60
F
2

TALLY OF CRITICAL PATH

STEP

ACTIVITIES

10

10

10

10

10

10

10

10

10

10

20,30

30

30

30

30

30

20

30

30

20

40,50,60

40

40

60

40

60

50

40

60

50

70

70

70

70

70

70

70

70

70

70

CEE536Example Problems

84

P.G. Ioannou & C. Srisuwanrat

ACTIVITY SELECTION AND TALLY TABLE

x
x

x
x

x
x

x
x

x
x

x
300

420

200

450

270

300

300

200

50

x
x

300

70

x
x

420

150

200

20

450

150

270

10

150

120

200

30

150

100

120

40

150

50

200

60

100

Slope

240

ACT

NETWORK LIMIT DETERMINATION TABLE

CYCLE

ACTS Changed

40

30

10

70

Network Limit

none

none

Days Changed
i

Lag

10

20

10

1
Lag

2
i

<<

<

30

<<

<

20

40

<

<

20

50

<

<

30

40

<<

<

<

<

30

60

<<

<

<

<

40

70

<

<

<

<

50

70

<

<

<

60

70

<

<

<

<

<<

<

<
<

<

Lag

1
Lag

Lag

Cycle 5

CEE536Example Problems

85

P.G. Ioannou & C. Srisuwanrat

2
A

10

600

300

20

800

650

30

480

240

40

300

100

50

1600

1000

60

1150

1100

70

500

300

20
B
2
0

10
A
2

40
D
2

30
C
4

8
50
E
4

8
0

sum 5430 3690 4410

Project Cost = 4210 + 200 = 4410
at 14 days with 3 critical paths.
Act 70 cannot be crashed anymore.

10
70
G
2

CN

CC

TN

TC

ID

8
60
F
2

TALLY OF CRITICAL PATH

STEP

ACTIVITIES

10

10

10

10

10

10

10

10

10

10

10

10

10

20,30

30

30

30

30

30

20

30

30

20

30

30

20

40,50,60

40

40

60

40

60

50

40

60

50

40

60

50

70

70

70

70

70

70

70

70

70

70

70

70

70

CEE536Example Problems

86

P.G. Ioannou & C. Srisuwanrat

ACTIVITY SELECTION AND TALLY TABLE

x
x
x

x
x

x
x

x
x

x
x

x
x
x

x
x

x
x

x
300

420

x
450

270

300

420

200

450

270

300

300

50

x
x

420

200

200

70

450

150

270

20

150

150

200

10

150

120

120

100

30

300

40

150

50

200

60

100

Slope

240

ACT

NETWORK LIMIT DETERMINATION TABLE

CYCLE

5.1

5.2

5.3

5.4

5.5

ACTS Changed

40

30

10

70

20,30

20,30

20,30

20,30

20,30

Network Limit

none

none

none

Days Changed

Lag

10

20

10
20

Lag

<<

<

30

<<

<

40

<

Lag

Lag

Lag

Lag

Lag

Lag

Lag

Lag

<

<

<<

<<

<<

<

<<

<

<<

<

<

<

<<

<<

<<

<

<<

<

<<

<

<

<<

<

<<

<

<

<<

<

20

50

30

40

<<

<

<

<

<<

<<

<<

30

60

<<

<

<

<

<<

<<

<<

<<

40

70

<

<

<

<

<

<

<

<

50

70

<

<

<

<

<

<

< <
<
<
< <
60 70
1
<
0
Since the network limit is NONE, the days changed is the minimum possible shorten days between activity 20 and 30. However, they are the same in this case.

<

<<

<
<

<

<

<

Cycle 6

CEE536Example Problems

87

P.G. Ioannou & C. Srisuwanrat

2
A

10

600

300

20

800

650

30

480

240

1
3

40

300

100

50

1600

1000

60

1150

1100

70

500

300

20
B
1
0

10
A
2

40
D
2

30
C
3

7
50
E
4

7
0

sum 5430 3690 4680

Project Cost = 4210 + 270 = 4680
at 14 days with 3 critical paths.
Act 20 and 30 cannot be crashed anymore.

9
70
G
2

CN

CC

TN

TC

ID

7
60
F
2

TALLY OF CRITICAL PATH

STEP

ACTIVITIES

10

10

10

10

10

10

10

10

10

10

10

10

10

10

10

10

20,30

30

30

30

30

30

20

30

30

20

30

30

20

30

30

20

40,50,60

40

40

60

40

60

50

40

60

50

40

60

50

40

60

50

70

70

70

70

70

70

70

70

70

70

70

70

70

70

70

70

CEE536Example Problems

88

P.G. Ioannou & C. Srisuwanrat

ACTIVITY SELECTION AND TALLY TABLE

x
x
x

x
x

x
x

x
x

x
x

x
x

x
x

x
x

x
450

300

420

x
450

270

300

420

200

450

270

300

300

50

x
x

420

200

200

70

450

150

270

20

150

150

300

10

150

120

120

100

30

300

40

150

50

300

60

100

Slope

240

ACT

NETWORK LIMIT DETERMINATION TABLE

CYCLE

ACTS Changed

40

30

10

70

20,30

40,50,60

Network Limit

none

none

none

none

Days Changed

Lag

10

20

10
20

Lag

<<

<

30

<<

<

40

<

Lag

Lag

Lag

<

<

<<

<

<

<

<<

<

Lag

20

50

30

40

<<

<

<

<

<<

<

30

60

<<

<

<

<

<<

<

40

70

<

<

<

<

<

<

<<

<

50

70

<

<

<

<

<<

<

<<

<
<

<

Lag

< <
< <
<< <
< <
60 70
1
<
0
Since the network limit is NONE, the days changed is the minimum possible shorten days between activity 40, 50 and 60. Thus, the days changed are 1 days.

Cycle 7

CEE536Example Problems

89

P.G. Ioannou & C. Srisuwanrat

10

600

300

20

800

650

30

480

240

40

300

100

50

1600

1000

60

1150

1100

1
3
1

70

500

300

20
B
1
0

10
A
2

40
D
1

30
C
3

6
50
E
3

6
0

sum 5430 3690 5130

Project Cost = 4680 + 450 = 5130
at 14 days with 3 critical paths.
Act 40 and 60 cannot be crashed anymore.

8
70
G
2

CN

CC

TN

TC

ID

6
60
F
1

TALLY OF CRITICAL PATH

STEP

ACTIVITIES

10

10

10

10

10

10

10

10

10

10

10

10

10

10

10

10

10

10

10

20,30

30

30

30

30

30

20

30

30

20

30

30

20

30

30

20

30

30

20

40,50,60

40

40

60

40

60

50

40

60

50

40

60

50

40

60

50

40

60

50

70
70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70
4
At this point it is impossible to reduce project duration since the only activity that can be shortened is activity 50.
So we cannot satisfy the condition of selecting only one critical activity from each critical path.

70

CEE536Example Problems

90

P.G. Ioannou & C. Srisuwanrat

x
x

x
x

x
x

x
x

x
x

X
300

420

x
450

x
300

x
450

270

300

x
420

x
450

x
300

x
200

420

200

300

x
x

450

50

270

200

150

70

200

150

150

20

120

150

150

10

x
x

200

120

100

100

30

300

40

x
x

50

240

60

270

ACTIVITY SELECTION AND TALLY TABLE

Slop
1
1
1
1
2
2
ACT
e

NETWORK LIMIT DETERMINATION TABLE

CYCLE

7 .1

7.2

7.3

ACTS Changed

40

30

10

70

20,30

40,50,60

50

50

50

Network Limit

none

none

none

none

none

Days Changed

Lag

10

20

10

Lag

<<

<

30

<<

<

20

40

<

<

<<

<

20

50

30

40

<<

<

<

<

<<

<

<

<

<<

<

30

60

<<

<

<

<

<<

<

40

70

<

<

<

<

<

50

70

<

<

<

<

<<

<
<

<

Lag

Lag

Lag

Lag

<

<<

<

<

<<

<

Lag

Lag

<
<<

<

Lag

X
<<

<

91

Lag

X
<<

< <
< <
<< <
<
<
< <
60 70
1
<
0
Since lag 40-70 is 0, we cannot move 70 forward as indicated in the table in cycle 7.2. Thus, we will cross (X) all the arrows for activity 70 out, shown in cycle
7.3.

CEE536Example Problems

P.G. Ioannou & C. Srisuwanrat

X
X

Final schedule at all crash point.

T

10

600

300

20

800

650

30

480

240

40

300

100

50

1600

1000

60

1150

1100

70

500

300

20
B
1
0

sum 5430 3690 5430

Project Cost = 5130 + 300 = 5430
at 14 days with 3 critical paths.
Act 40 and 60 cannot be crashed anymore.

2
10
A
2

6
40
D
1

CN

30
C
3

CC

TN

TC

ID

5
50
E
2

6
1

70
G
2

6
60
F
1

Direct
Duration
Cost
15
3690
1
14
3790
2
13
3910
3
11
4210
4
10
4410
5
9
4680
6
8
5130
7
8
5430
Given indirect cost is $250/day.
Cycle

CEE536Example Problems

Indirect
Cost
3750
3500
3250
2750
2500
2250
2000
2000

Total
Cost
7440
7290
7160
6960

6910
6930
7130
7430

92

P.G. Ioannou & C. Srisuwanrat

Cost

8000

Total Cost

7430

7500

7130

7000

7160

6960

6930

7440

7290

6910

6500
6000
5430

5500

5130

5000

4680

Direct Cost

4500
4410

4000

4210

3910

3790

3750
3690

3500

3250

3500 Indirect Cost

3000
2750

2500

2500
2250

2000
2000

Project Duration

1500
7

CEE536Example Problems

10

11

12

13

14

93

15

16

P.G. Ioannou & C. Srisuwanrat

8. TIME-COST TRADEOFF-LP

Example of Time-Cost Tradeoff using LINDO

Step 1: Calculate COST SLOPE (b) for each activity as shown in the table above.
Step 2: Coding in LINDO (see Figure 2)
Step 2.1: Setup OBJECTIVE FUNCTION in LINDO
MIN -150 T20 - 300 T30 -150 T32 - 450 T40 - 400 T42 - 300 T44 - 600 T50 - 250
T52a - 200 T60 - 100 T52b - 200 T70 + 35850 FIXED

Step 2.2: Tell LINDO, where constraints START by typing in

ST

Step 2.3: Setup PRECEDENCE CONSTRAINTS

T10 + ESD10 - ESD20 <= 0
T20 + ESD20 - ESD30 <= 0
T20 + ESD20 - ESD32 <= 0
T30 + ESD30 - ESD40 <= 0
T30 + ESD30 - ESD42 <= 0
T32 + ESD32 - ESD40 <= 0

CEE536Example Problems

95

P.G. Ioannou & C. Srisuwanrat

T32 + ESD32 - ESD42 <= 0

T32 + ESD32 - ESD44 <= 0
T40 + ESD40 - ESD50 <= 0
T40 + ESD40 - ESD52a <= 0
T42 + ESD42 - ESD50 <= 0
T42 + ESD42 - ESD52a <= 0
T44 + ESD44 - ESD52a <= 0
T50 + ESD50 - ESD60 <= 0
T52a + ESD52a - ESD52b <= 0
T52b + ESD52b - ESD60 <= 0
T60 + ESD60 - ESD70 <= 0

Step 2.4: Setup ACTIVITY DURATION CONSTAINTS

T10 >= 5
T10 <= 5
T20 >= 1
T20 <= 3
T30 >= 4
T30 <= 7
T32 >= 3
T32 <= 5
T40 >= 3
T40 <= 6
T42 >= 3
T42 <= 5
T44 >= 4
T44 <= 7
T50 >= 5
T50 <= 10
T52a >= 4
T52a <= 6

CEE536Example Problems

96

P.G. Ioannou & C. Srisuwanrat

T60 >= 1
T60 <= 2
T52b >= 0
T52b <= 2
T70 >= 2
T70 <= 3

Step 2.5: Setup PROJECT START DATE

ESD10 = 0

Step 2.6: Setup TARGETED PROJECT DURATION

T70 + ESD70 <= 36

Note that, number of the right hand side should set to NORMAL POINT of project
duration, which is 36 days for this example.
Step 2.7: Assign value to FIXED CONSTANT
FIXED = 1

Note that, because LINDO does not allow constants in objective function, we must create
variable (instead of constants) call FIXED in objective function and then assign value of
1 to it later.
Step 2.8: Tell LINDO where constraints END by typing in
END

Step 3.1: Run Solve. (See Figure 3.1)

Step 4.1: After you solve the problem, go to Reports

Parametrics. (See Figure 4.1)

Step 4.2: Setup Parametric Row and New RHS. (See Figure 4.2)
Step 5: Get results from Report Window (Figure 5.1) and Parametrics Graph Window (Figure
5.2)

CEE536Example Problems

97

P.G. Ioannou & C. Srisuwanrat

Begin the new project with blank file.

Figure 1: Blank LINDO File.

CEE536Example Problems

98

P.G. Ioannou & C. Srisuwanrat

Figure 2: Coding.
Note that, the highlighted row is called Parametric Row, which will be used to derive
minimum project cost at different project duration. Each equation (objective function and
constaints) equals to 1 row, excluding ST and END commands. So, the Parametric Row in
Figure 2 is 44.

CEE536Example Problems

99

P.G. Ioannou & C. Srisuwanrat

Figure 3.1: Solving

CEE536Example Problems

100

P.G. Ioannou & C. Srisuwanrat

Figure 3.2: After solving the problem , click No, and the Close.

CEE536Example Problems

101

P.G. Ioannou & C. Srisuwanrat

Figure 3.3: To check the results from solving (or minimizing) the problem under the condition of
project duration must equal to 36 days based on the highlighted code.

CEE536Example Problems

102

P.G. Ioannou & C. Srisuwanrat

Figure 3.4: Results from solving (or minimizing) the problem at specified project duration of 36
days.

CEE536Example Problems

103

P.G. Ioannou & C. Srisuwanrat

Figure 4.1: Parametrics

CEE536Example Problems

104

P.G. Ioannou & C. Srisuwanrat

Figure 4.2: Setup Parametric options.

We want LINDO to automatically change the project duration and find the minimum project
cost. To do so, set New RHS Value to CRASH POINT of project duration. (RHS = Right Hand
Side). LINDO will change the number on the RHS of the code in the specified Parametric Row
(highlighted code in Figure 2)
Make sure your Parametric Row is correct. Each equation equals to 1 row, excluding ST and
END commands.

Figure 5.1: Results from Report Window.

Notice that, LINDO optimized project cost from 36 days (our original value or NORMAL
POINT) to 25 days (our New RHS Value or CRASH POINT)

CEE536Example Problems

105

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

106

P.G. Ioannou & C. Srisuwanrat

Using Excel Solver to solve Time-Cost Tradeoff problem

CEE536Example Problems

107

P.G. Ioannou & C. Srisuwanra

CEE536Example Problems

108

P.G. Ioannou & C. Srisuwanra

CEE536Example Problems

109

P.G. Ioannou & C. Srisuwanra

CEE536Example Problems

110

P.G. Ioannou & C. Srisuwanra

CEE536Example Problems

111

P.G. Ioannou & C. Srisuwanra

CEE536Example Problems

112

P.G. Ioannou & C. Srisuwanra

CEE536Example Problems

113

P.G. Ioannou & C. Srisuwanra

9. RESOUCE LEVELING

MINIMUM MOMENT METHOD

Resource Leveling

In this section, the two concepts of resource leveling, Minimum Moment Method and PACK, are discussed. First lets take a
look at the network diagram below consisting of 7 activities. As shown in the bar chart and resource profile, if activities are scheduled
at their early start date (ESD), this project requires the MAXIMUM RESOURCE of SIX on day 5 and 6. On the other hand, this
schedule will use only ONE resource on day 8, 9, and 10. This fluctuation of resource profile may result in difficulty in managing
resource. Consequently, it adversely affects the project.

CEE536Example Problems

115

P.G. Ioannou & C. Srisuwanrat

Now, look at the new resource profile after it is leveled. As you can see, maximum resource required reduces from 6 to 4 without
increasing project duration. You may wonder what if we apply limited resource allocation with maximum resource available of 4.
Well, hopefully the next 3 questions and answers will make my point clearer.

CEE536Example Problems

116

P.G. Ioannou & C. Srisuwanrat

Question 1: So, what is the main focus here?

Answer 1.1: Reduce fluctuation in resource profile, while project duration remains the same.
Question 2: Why dont just use Limited Resource Allocation?
Answer 2.1: Limited resource allocation doesnt directly solve the problem of fluctuation. The maximum resource required may
change but the resource profile could STILL be fluctuated.
Answer 2.2: Applying limited resource allocation might increase project duration. We dont want to delay the project!!
Answer 2.3: We may not really have the maximum number of available resource yet.
Question 3: So! What do we do?
Answer 3: Minimum Moment Method (MOM) or PACK.
One last time, I want to point out the followings
1) Unlimited resource leveling reduces fluctuation in resource profile.
2) Unlimited resource leveling never delays critical activities.
3) Accordingly, unlimited resource leveling never increases project duration.

CEE536Example Problems

117

P.G. Ioannou & C. Srisuwanrat

Before going into detail, I want to give you a big picture of these 2 resource leveling methods.
PRIORITY OF NON-CRITICAL ACTIVITIES

In MOM, calculation starts from the LAST sequence step. This means non-critical activities in the LATER sequence step have
higher priority than those in the EARLIER sequence step. Then, what is called Improvement Factor is used to prioritize non-critical
activities in the same sequence step.
In PACK, it just goes right at the problem. It takes all the non-critical activities out of resource profile (this method is
hardcore). And then, place them one by one in the order of MAX to MIN number of resource required. Activity requiring more
resource has higher priority than activity needs less resource (this is actually a smart way). As shown in PACK picture, non-critical
activities are removed from resource profile. Then, they are positioned one by one at a time.

CEE536Example Problems

118

P.G. Ioannou & C. Srisuwanrat

MEASUREMENT OF RESOURCE PROFILE

For both methods, a parameter called RIC is used in order to determine the OVERALL improvement in resource profile after
leveling.

RIC =

n R 2

( R )

n = project duration
R = Sum of resource required for a particular day
More about RIC can be found in Precedence and Arrow Networking Techniques for Construction by Robert B. Harris
Minimum Moment Method (MOM)

MOM uses a factor calls IMPROVEMENT FACTOR (IF) to measure the effectiveness of scheduling non-critical activity at
different positions. The greater the IF, the better it is.
IF ( Act , S ) = r ( X W mr )

S = Number of shifting day (start from 1 to the minimum current lag of between the activity and its successors)
r = Number of resources required by the activity
X = Sum of resources in the range of the activity BEFORE shifting
W = Sum of resources in the range of the activity AFTER shifting
m = The minimum between S and T (duration of the activity).
See! The formula is very simple. Now lets solve the previous problem using MOM.
Here is 2 simple rules about shifting activity according to derived IF.
1) Negative value of IF is neglected. NO shifting.

CEE536Example Problems

119

P.G. Ioannou & C. Srisuwanrat

2) Only shifting ONE activity with highest IF, one at a time.

(NEVER SHIFT 2 ACTIVITIES IN THE SAME ROUND)
3) If there is a tie of IF in one activity, shifting the activity to the higher S.
For example, IF(M,2) = 12 and IF (M,4) = 12
Act M will be shifted by 4 days to give room for its predecessors (make sense, right)
4) If there is a tie of IF between two activities, shifting the activity with the higher resource require.
5) If there is more than one activity in a SQS, you probably have to recalculate IF for the 2nd round, AT
LEAST.

CEE536Example Problems

120

P.G. Ioannou & C. Srisuwanrat

Example on Minimum Moment Method (MOM)

Please level the below project using MOM.

Sequence Step 4 Round 1.

First, we start from the last sequence step. However, since there is no non-critical activity in SQS 4, we move on SQS 3.

CEE536Example Problems

121

P.G. Ioannou & C. Srisuwanrat

Sequence Step 3 Round 1.

CEE536Example Problems

122

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

123

P.G. Ioannou & C. Srisuwanrat

IF ( Act , S ) = r ( X W mr )

Act
E
E
E
E
F
F
F

S
1
2
3
4
1
2
3

r
X
W
m = min(S,T) IF
1 6+6 = 12 6+5 = 11
1
0
1
12
5+1= 6
2
4
1
12
1+1 = 2
2
8
1
12
1+1 =2
2
8
2 6+6+5=17 6+5+1=12
1
6
2
17
5+1+1=7
2
12
2
17
1+1+1=3
3
16

According to the IF from the above table, Act F is shifted by 3 days, since it provides the max IF.
Note: IF of shifting E by 4 days equals to shifting it by 3 days. So, I didnt show it here.

CEE536Example Problems

124

P.G. Ioannou & C. Srisuwanrat

Sequence Step 3 Round 2. Since shifting F changes resource profile within the range of Act E, it is necessary to recalculate IF of E
again. And see if there is positive value of IF. Dont forget to update the resource profile after shifting F!!

IF ( Act , S ) = r ( X W mr )

CEE536Example Problems

125

P.G. Ioannou & C. Srisuwanrat

Act
E
E
E
E

S
1
2
3
4

r
X
W
m = min(S,T) IF
1 4+4 = 8 4+3 = 7
1
0
1
8
3+3= 6
2
0
1
8
3+3 = 6
2
0
1
8
3+3 =6
2
0

Thus in SQS 3 Round 2, activity E is shifted by 4 days. Why not shifting E by either 2 or 3 days since they have the same IF????

CEE536Example Problems

126

P.G. Ioannou & C. Srisuwanrat

Sequence Step 2 Round 1. Calculate IF of Act C. Dont forget to update the resource profile after shifting E!!

Act S r
CEE536Example Problems

W
127

m = min(S,T) IF
P.G. Ioannou & C. Srisuwanrat

C
C
C

1 1 4+4 = 8 4+3 = 7
2 1
8
3+3= 6
3 1
8
3+3 = 6

1
2
2

0
0
0

Thus, shift Act C by 3 days.

Sequence Step 1 Round 1. There is no non-critical activity in this SQS.

At this point, we have finished the forward pass. However, we have to repeat the process again in the opposite way, called
BACKWARD PASS. The reason for this is to:
1) To check and improve resource profile
2) To check if activities can gain some floats back without increasing RIC (or fluctuation)
The process of BACKWARD PASS is exactly the same as FORWARD PASS, only this time the calculation start from the first
sequence step to the last step, and activities are shifted from the right to left.
Backward Pass: Sequence Step 1. There is no non-critical activity.
Backward Pass: Sequence Step 2 Round 1. Calculate IF of Act C.

CEE536Example Problems

128

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

129

P.G. Ioannou & C. Srisuwanrat

Act
C
C
C

S
1
2
3

r
X
W
m = min(S,T) IF
1 4+4 = 8 4+3 = 7
1
0
1
8
3+3= 6
2
0
1
8
3+3 = 6
2
0

Thus, shift Act C to the left by 3 days. New RIC = 1.0440.

As you can see, RIC is the same. However, activity C gains some floats back.

CEE536Example Problems

130

P.G. Ioannou & C. Srisuwanrat

Backward Pass: Sequence Step 3 Round 1.

Calculate IF of Act E and F.

Note that IF of shifting Act E by 4 days is the same as shifting E by 3 days.

CEE536Example Problems

131

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

132

P.G. Ioannou & C. Srisuwanrat

Act
E
E
E
E
F
F
F

S
1
2
3
4
1
2
3

r
X
W
m = min(S,T) IF
1 4+4 = 8
4+3 = 7
1
0
1
8
3+3= 6
2
0
1
8
3+3 = 6
2
0
1
8
3+3 =6
2
0
2 4+4+3=10 4+3+3=10
1
-4
2
10
3+3+3=9
2
-6
2
10
1+3+3=9
3
-10

Thus, shift Act E backward by 4 days.

CEE536Example Problems

133

P.G. Ioannou & C. Srisuwanrat

Backward Pass: Sequence Step 3 Round 2.

Calculate IF of Act F.

CEE536Example Problems

134

P.G. Ioannou & C. Srisuwanrat

Act
F
F
F

S
1
2
3

r
X
W
m = min(S,T) IF
2 3+3+3 = 9 3+3+3 = 9
1
-4
2
9
4+3+4= 10
2
-10
2
9
4+4+3 = 11
3
-16

Since all IF of Act F are negative, Act F stays in the same position. Move on to SQS 4.
Backward Pass: Sequence Step 4. Since there is no non-critical activity in this SQS, The calculation of MOM ends here at the

backward pass of the last sequence step. YEAH!! Eventually, we have solved this problem of resource leveling using MOM.

Resource Required
7
6
5
4

C-1

3
2
1

Resource Profile 2

F-2

B-3

A-2
2

E-1
G-3

D-1
4

10

2 4 4 4 4 3 3 3 3 3

Day

12
3

RIC = 1.0440

CEE536Example Problems

135

P.G. Ioannou & C. Srisuwanrat

Problem 9.1 Leveling the following network using Minimum Moment Method (MOM)

Activity

A
B
C
D
E
F
G
H
I
J
K
L
M

CEE536Example Problems

Predecessors

Duration

Resource Rate

A
A
A
B
B,C
B
E,F
D, F,G
C,G
H
H, I, J
K,L

6
2
11
3
5
4
2
5
4
3
4
4
7

5
7
2
4
4
5
9
3
6
5
0
3
7

136

P.G. Ioannou & C. Srisuwanrat

Problem 9.2 Leveling the following network using Minimum Moment Method (MOM)
Activity
A
B
C
D
E
F
G
H
I
J

CEE536Example Problems

Predecessors

Duration
2
3
5
2
4
3
10
4
2
3

A
A
B
B
C
C
E
E,F
D,H,I,G

137

Resource Rate
7
2
2
3
1
2
2
5
3
6

P.G. Ioannou & C. Srisuwanrat

Solution 9.1 Minimum Moment

Sequence Step 6. No activity can be shifted
Sequence Step 5. No activity can be shifted
SEQUENCE STEP 4 is very IMPORTANT please read carefully.

Sequence Step 4, there are 2 non-critical activities, I and J, that can be shifted. So calculate IF of activities I and J.
DA
Y

2
7

2
8

2
9

3
0

1
0

1
1

1
2

1
3

1
4

1
5

1
6

1
7

E
F
G

1
8

1
9

2
0

2
1

2
2

2
3

2
4

2
5

2
6

Res

1
3

1
9

1
5

1
0

1
0

3
2

3
3

3
4

3
5

3
6

3
7

M
1
3

3
1

1
0

RIC = 1.3126

CEE536Example Problems

138

P.G. Ioannou & C. Srisuwanrat

ACT
I
J
J
J
J
J

S
1
1
2
3
4
5

r
6
5
5
5
5
5

X
36
30
30
30
30
30

W
30
25
24
23
27
27

m
1
1
2
3
3
3

IF
0
0
-20
-40
-60
-60

30

21

-30

Activity with the highest Improvement Factor will be shifted. In this sequence step 4 round 1, both IF(I,1) and IF(J1) have the same IF
of 0. However, we only shift one activity at a time.
So we choose the activity with a higher resource rate. Thus, shift activity I by one day.
??? What If they both have the SAME resource rate.???? Please check your course pack.

CEE536Example Problems

139

P.G. Ioannou & C. Srisuwanrat

Sequence Step 4 the 2nd round. Since shifting activity I affects resource profiles within the possible range of activity J, which can be
shifted; day 18 to day 26. As shown, resource profiles on day 22 and 26 have changed due to shifting activity I. Thue, we have to
recalculate IF of activity J.
DAY

A
B

5
7

27

28

29

30

10

11

12

13

14

15

16

17

19

20

21

22

23

24

25

26

H
I
J

13

32

33

34

35

36

37

M
RES

31

F
G

18

13

19

IF

15

10

10

10

RIC = 1.3126
ACT

30

25

30

18

10

30

17

-10

30

21

-30

30

27

-60

30

27

-60

CEE536Example Problems

Shift activity J by two days.

We do not have to check activity I again because it cannot be shifted any further from
its current position.

140

P.G. Ioannou & C. Srisuwanrat

Sequence step 3. Possibly shifted activities in Sequence Step 3 are E and G.

DAY

10

11

12

13

14

15

16

17

27

28

29

30

18

19

20

21

F
G

22

23

24

25

26

I
J

13

13

33

34

35

36

19

15

10

10

RIC = 1.3009
ACT

IF

ACT

IF

52

35

52

34

21

36

52

22

88

34

12

36

52

18

88

34

12

36

52

14

88

34

72

52

13

76

34

108

52

16

64

34

108

52

24

32

34

108

52

32

34

81

34

10

54

For activity G, there are three shift positions having IF of 108. Shift to the further most in order to give room to its direct and indirect
predecessors in earlier sequence step. Thus, shift activity G by 7 days.
Sequence Step 3 the 2nd round. Since shifting activity G affects resource profile within possible range, activity E can be shifted, so we
have to recalculate IF of activity E.

CEE536Example Problems

37

M
5

32

RES

31

141

P.G. Ioannou & C. Srisuwanrat

DAY

10

11

12

13

14

15

16

17

4
4

4
9

F
G

18

19

20

21

22

I
J

23

24

25

26

27

28

29

30

M
5

13

13

10

11

11

10

10

32

33

34

35

36

37

RES

31

RIC = 1.174
We do not recalculate IF for activity G this time because it is the recent activity which is shifted. However, if you calculate it, you will
get the same IF for those days having left for possible shifting position of the activity.

CEE536Example Problems

142

P.G. Ioannou & C. Srisuwanrat

ACT
E
E

S
1
2

r
4
4

X
34
34

W
26
22

m
1
2

IF
16
16

E
E
E
E

3
4
5
6

4
4
4
4

34
34
34
34

27
32
31
34

3
4
5
5

-20
-56
-68
-80

E
E

7
8

4
4

34
34

42
41

5
5

-112
-108

CEE536Example Problems

Shift activity E by two days. Since shifting activity E by two days does not affect resource profile
within possible range that activity G can be shifted, we do not have to recalculate IF of activity G
again.
Assume that if activity E is shifted by three days, resource profile within range of possible shift of
activity G will be affected, so we must recalculate IF of activity G. And not recalculate IF of activity E
for now since we have just shifted it.

143

P.G. Ioannou & C. Srisuwanrat

Sequence step 2. There are two non-critical activities, B and D, which can be shifted.
DAY

10

11

12

13

14

15

16

17

27

28

29

30

E
F
G

18

19

20

21

22

23

24

25

26

I
J

RIC=

13

13

11

33

34

35

36

11

10

10

1.1552

CEE536Example Problems

37

M
5

32

RES

31

144

P.G. Ioannou & C. Srisuwanrat

ACT

IF

26

19

26

28

32

21

28

32

14

40

32

14

24

32

18

32

18

32

18

32

23

-12

32

28

-32

32

27

-28

10

32

21

-4

11

32

20

12

32

25

-20

13

32

28

-32

CEE536Example Problems

Shift activity D by two days.

145

P.G. Ioannou & C. Srisuwanrat

Sequence Step 2 the second time. Since shifting activity D affects resource profile within possible range in which activity B can be shifted,
we have to recalculate IF of activity B.
DAY

A
B

5
7

27

28

29

30

10

11

12

13

14

15

16

17

4
4

4
9

F
G

18

19

20

21

22

I
J

23

24

25

26

RIC=

10

11

11

10

10

32

33

34

35

36

37

M
RES

31

1.1082

ACT

IF

18

15

-28

18

12

-56

There is no better position for B than the current position.

Since we do not shift activity B, resource profile remains the same.

Sequence step 1. There is no activity that can be shifted forward.

CEE536Example Problems

146

P.G. Ioannou & C. Srisuwanrat

BACKWARD PASS

Sequence step 1. There is no activity that can be shifted backward.

Sequence step 2. Activity D. Since activity B cannot be shifted back ( positioned any earlier than its current position ),
we do not have to calculate IF of activity B.
DAY

27

28

29

30

10

11

12

13

14

15

16

17

4
4

F
G

18

19

20

21

22

23

24

25

26

I
J

5
IF
12
40

10

11

33

34

35

36

37

M
RIC=

32

Res

31

11

10

10

1.1082

ACT

22

21

22

24

CEE536Example Problems

No shifting

147

P.G. Ioannou & C. Srisuwanrat

Sequence step 3.
Activities E and G.
DAY

A
B

5
7

27

28

29

30

10

11

12

13

14

15

16

17

4
4

4
9

F
G

18

19

20

21

22

I
J

23

24

25

26

RIC=

10

11

11

10

10

32

33

34

35

36

37

M
Res

31

1.1082

ACT

IF

34

34

-16

34

34

-32

22

17

-36

22

12

-72

22

12

-72

22

12

-72

22

16

-108

22

16

-108

22

12

-72

CEE536Example Problems

No shifting

148

P.G. Ioannou & C. Srisuwanrat

Sequence step 4. Activities E and G.

DAY

27

28

29

30

10

11

12

13

14

15

16

17

F
G

18

19

20

21

22

23

24

25

26

I
J

10

11

33

34

35

36

37

M
RIC=

32

Res

31

11

10

10

1.1082

ACT

IF

36

35

-30

28

25

-10

28

20

-10

RIC = 1.1082 ( originally 1.3126 )

No shifting
Max Resource Requirement in day is 11 ( originally 19 )

Sequence step 5. There is no activity that could be possibly shifted backward.

Sequence step 6. There is no activity that could be possibly shifted backward.
In this case since there is no shifting during backward pass, there is high chance that this is the best result for Minimum Moment Method
algorithm. If there is shifting during backward pass, we should do forward and backward passes again. However, the result would not be
much improved.
The following is a part of a network that is resource-leveled by using Minimum Moment Method. This example shows how to save
time in calculating Improvement Factor in the same sequence step where many non-critical activities exist.

CEE536Example Problems

149

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

150

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

151

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

152

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

153

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

154

P.G. Ioannou & C. Srisuwanrat

10.RESOUCE LEVELING

PACK

Example of PACK (an unlimited resource leveling method)

CEE536Example Problems

156

P.G. Ioannou & C. Srisuwanrat

A-2
2

C-2
4

B-3
3

11

D-1
2

11

13

13

E-3
2

14

F-4
1

Resource Required
7
6

X-2
2

Y-4
2

Z-4
1

5,0

5,0

6,6

3
2
1

B-3

A-2
2
2

Resource required/day from Max to

Min

4
5

E-3

C-2
6
7

D-1

8
6

10
2

14

12
1

6
5

Sequence step from Max to Min

4
2

ACT
Y
Z
X

RES
4
4
2

TF
5
6
5

NO
.
1
2
3

F
4

Resource Required

Total float from Min to Max

Z
4

Y-4

X-2

SQS
3
4
2

B-3

A-2
2
2

E-3

C-2
6

D-1

8
2

F
4

10
2

14

12
1

In the beginning, resource profile of PACK only includes resources that must occupy that particular day. Thus, most of
resources in this resource profile are of critical activities, and

CEE536Example Problems

157

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

158

P.G. Ioannou & C. Srisuwanrat

BEFORE placing Ys PRED and SUCC

in a position with minimum sum of
resource

Without considering Ys PRED and SUCC

positions
7

Y-4

3
2
1

B-3

A-2
2
2

C-2

4
3

E-3

6
3

D-1

8
2

10
2

B-3

A-2
2

14
3

Without considering Ys PRED and SUCC

positions

Y-4

2
Day

12

F
4

AFTER placing Ys PRED and SUCC

in a position with minimum sum of
resource

C-2

4
3

E-3

6
3

8
2

F
4

D-1
10
2

2
Day

12
3

7
6

4
Y-4

2
1

B-3

A-2
2
2

4
3

E-3

C-2
6
3

D-1

8
2

10
2

12
1

Y-4

2
Day

B-3

A-2
2

14
3

C-2

4
3

6
3

D-1

10

Day
14

12
3

4
3

E-3

C-2
6
3

F
4

D-1

10
2

Y-4

2
Day

12
1

3
1

14
3

B-3

A-2

4
3

E-3

C-2

6
3

8
2

159

F
4

D-1
10

Day
12

As shown, the best position of Y in position 10-11 is not the best position for the overall
project after considering the possibility of scheduling its non-critical PRED and SUCC.

CEE536Example Problems

F
4

F
4

E-3

AFTER placing Ys PRED and SUCC

in a position with minimum sum of
resource

Without considering Ys PRED and SUCC

positions

B-3

A-2

14

Y-4

P.G. Ioannou & C. Srisuwanrat

14
3

CEE536Example Problems

160

P.G. Ioannou & C. Srisuwanrat

Tentative position of Y without shifting

Tentative position of Y with 2 shifting

days

Tentative position of Y with 1 shifting day

Resource Required

Resource Required

Resource Required

Y-4

4
3
2
1

B-3

A-2
2
2

E-3

C-2

6
3

8
2

10
2

2
Day

Tentative position of Y with 3 shifting

days
Resource Required

B-3

A-2

14

12
1

F
4

D-1

Y-4

C-2

4
3

E-3

6
3

D-1

8
2

10
2

2
Day

Tentative position of Y with 4 shifting

days
7

3
2
1

B-3

A-2
2
2

Ys position

C-2

4
3

E-3

6
3

Day

D-1

10
2

12
1

14
3

B-3

A-2

E-3

C-2

4
3

4
3

6
3

D-1

8
2

10
2

Day
12

14
3

Y-4

F
4

C-2

F
4

Resource Required

Y-4

E-3

Tentative position of Y with 5 shifting

days

Resource Required

B-3

A-2

14

12
1

Y-4

F
4

6
3

D-1

8
2

10
2

Y-4

2
Day

B-3

A-2
2

14

12
1

F
4

C-2

4
3

E-3

6
3

D-1

8
2

F
4

10
2

Day
12

14
3

Xs best
Zs best position Min RS(Z)
Min RS(X)

position
5-6 (ESD)
3-4
10
12
3+2=5
3+3=6
1
6-7
3-4
10
9
2+2=4
6
1
7-8
4-5
10
10
2+2=4
3+2=5
1
8-9
5-6
10
9
2+2=4
2+2=4
1
9-10
5-6
11
2+1=3
4
1
8 Min
10-11
5-6
12
9
1+1=2
4
3
Thus, we will place activity Y on day 9-10. Then, do the same calculation for activity Z and X. However, the calculation becomes a
lot easier and faster since they, both, have no non-critical PRED and SUCC that havent been assigned. You can just look at your
updated resource profile and assign both activities on those days with minimum resource.
RS(Y)

CEE536Example Problems

161

P.G. Ioannou & C. Srisuwanrat

Graphical explanation for the previous page.

Tentative position of Y without shifting,
and best position for its PRED and
SUCC

Tentative position of Y with 1 shifting day, and

Tentative position of Y with 2 shifting days,
best position for its non-critical PRED and
and best position for its non-critical PRED and
SUCC
SUCC
Resource Required

Resource Required

Resource Required

Y-4

4
3
2
1

B-3

A-2
2
2

E-3

C-2

6
3

8
2

10
2

2
Day

B-3

A-2

14

12
1

F
4

D-1

Y-4

4
3

E-3

C-2
6
3

8
2

F
4

D-1
10
2

2
Day

B-3

A-2

14

12
1

Y-4

4
3

E-3

C-2
6
3

D-1

8
2

F
4

10
2

Day
14

12
1

Tentative position of Y with 3 shifting days,

Tentative position of Y with 4 shifting days,
Tentative position of Y with 5 shifting days,
and best position for its non-critical PRED and and best position for its non-critical PRED and and best position for its non-critical PRED and
SUCC
SUCC
SUCC
Resource Required
Resource Required
Resource Required

Y-4

3
2
1

B-3

A-2
2
2

4
3

E-3

C-2
6
3

CEE536Example Problems

10
2

B-3

A-2

14

12
1

2
Day

D-1

8
2

F
4

Y-4

2
2

4
3

E-3

C-2
6
3

162

10
2

B-3

A-2

14

12
1

Y-4

2
Day

D-1

F
4

2
2

4
3

E-3

C-2
6
3

D-1

8
2

F
4

10
2

Day
14

12
1

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

Zs position

RS(Z)

11
12
13

1
3
3

1 Min
3
3

163

P.G. Ioannou & C. Srisuwanrat

Tentative position of X without shifting

Tentative position of Y with 2 shifting

days

Tentative position of X with 1 shifting day

Resource Required

Resource Required

Resource Required

5
X-2

4
2
1

B-3

A-2
2
2

E-3

C-2

4
3

Z
4

Y-4

6
3

10
6

Day
3

B-3

A-2
2
2

E-3

C-2

4
3

4
3

6
3

D-1

8
2

6
3

10
6

Day
12

B-3

A-2
2

14

10
6

Day
12

A-2
2

14
3

Xs position

B-3

E-3

C-2

6
3

C-2

4
3

E-3

6
3

D-1

8
2

F
4

10
6

Day
12

14
3

RS(X)

F
4
Day

D-1

8
2

Z
4

Y-4

X-2

F
4

D-1

8
2

Z
4

Y-4

X-2

3
1

C-2

Z
4

Y-4

Resource Required

E-3

X-2

F
4

Tentative position of X with 4 shifting

days

Tentative position of X with 3 shifting

days
Resource Required

B-3

A-2

14

12
5

Z
4

Y-4

F
4

D-1

5
X-2

10
6

12
5

14
3

3-4
6
3+3=6
4-5
6
3+3=6
5-6
5
3+2=5
6-7
4 Min Choose this one!!
2+2=4
7-8
4 Min
2+2=4
If there is a tie in sum of resource, we choose the earlier position because it gives the activity more float.

CEE536Example Problems

164

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

165

P.G. Ioannou & C. Srisuwanrat

PACKS CALCULATION TABLE

SQS

RES

AC

JC

DUR

ACT

No

assign

10

11

12

13

14

RS

1
2
3
RIC =

CEE536Example Problems

166

P.G. Ioannou & C. Srisuwanrat

Problem 10.1 Leveling the following network using PACK

Activity

A
B
C
D
E
F
G
H
I
J
K
L
M

CEE536Example Problems

Predecessors

Duration

Resource Rate

A
A
A
B
B,C
B
E,F
D, F,G
C,G
H
H, I, J
K,L

6
2
11
3
5
4
2
5
4
3
4
4
7

5
7
2
4
4
5
9
3
6
5
0
3
7

167

P.G. Ioannou & C. Srisuwanrat

Solution for 10.1 PACK problem. (Note: Because of the limited page space, day 1 to 7 and day 31 to 37 are not shown here.)

SQS

RES

AC

JC

DUR

ACT

11

27

28

29

30

8
13
3

10

11

12

13

14

15

16

17

9
6

20

21

11
4

19

8
3

18

1
4

5
6

No

assign

RS

22

23

24

25

26

2
2

1
2
3
4
5
6
RIC =

CEE536Example Problems

168

P.G. Ioannou & C. Srisuwanrat

PROCESSING QUEUE

ACT
AC =
DUR =

G
11
2

Assign to day 9-10

CEE536Example Problems

G
Assign.
9-10
10-11
11-12
12-13
13-14
14-15
15-16
16-17
17-18
18-19
19-20
20-21
21-22

No

ACT

RES

TF

SQS

12

5
6

E
D

4
4

8
13

3
2

RS(G)
4
4
4
4
4
4
4
4
7
10
10
10
10

B
Assign.
7-8
7-8
7-8
7-8
7-8
7-8
7-8
7-8
7-8
7-8
7-8
7-8
7-8

minRS(B)
4
4
4
4
4
4
4
4
4
4
4
4
4

169

I
Assign.
22-25
22-25
22-25
22-25
22-25
22-25
22-25
22-25
22-25
22-25
22-25
22-25
23-26

minRS(I)
3
3
3
3
3
3
3
3
3
3
3
3
3

J
Assign.
20-22
20-22
20-22
20-22
20-22
20-22
20-22
20-22
20-22
20-22
21-23
24-26
24-26

minRS(J)
13
13
13
13
13
13
13
13
13
13
17
21
21

24
24
24
24
24
24
24
24
27
30
34
38
38

P.G. Ioannou & C. Srisuwanrat

SQS

RES

AC

JC

DUR

ACT

11

4
5

27

28

29

30

8
2

13

10

11

12

13

14

15

16

17

20

21

11
4

19

8
3

18

23

24

25

26

1
4

22

6
No

assign

RS

9-10

11

11

D
RIC =

CEE536Example Problems

170

P.G. Ioannou & C. Srisuwanrat

ACT
AC =
DUR =
Assign to day

B
0
2
7-8

B
Assign.
7-8

AC =
DUR =
Assign to day

1
4
22-25

Assign.
22-25
23-26

RS(I)
3
3

ACT
AC =
DUR =
Assign to day

J
6
3
18-20

J
Assign.
18-20
19-21
20-22
21-23
22-24
23-25
24-26

RS(J)
15
15
19
23
27
27
21

ACT

CEE536Example Problems

RS(B)
4

D
Assign.
11-13
11-13

minRS(D)
6
6

9
9

15
15
19
23
27
27
21

171

P.G. Ioannou & C. Srisuwanrat

ACT
AC =
DUR =
Assign to day

E
6
3
11-15

ACT
AC =
DUR =
Assign to day

D
12
3
15-17

CEE536Example Problems

E
Assign.
9-13
10-14
11-15
12-16
13-17
14-18
15-19
16-20
17-21
D
Assign.
7-9
8-10
9-11
10-12
11-13
12-14
13-15
14-16
15-17
16-18
17-19
18-20
19-21

RS(E)
28
19
10
10
10
18
26
34
37

28
19
10
10
10
18
26
34
37

RS(D)
29
31
28
23
18
18
18
14
10
14
22
30
25

29
31
28
23
18
18
18
14
10
14
22
30
25

172

P.G. Ioannou & C. Srisuwanrat

SQS

RES

AC

JC

DUR

ACT

11

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

8
2

12

13
3

8
3

11
4

1
4

6
No

assign

RS

9-10

7-8

22-25

18-20

11-15

15-17

RIC = 1.120

CEE536Example Problems

2
9

11

11

9
9

11

11

6
10

10

173

10

10

10

10

10

10

P.G. Ioannou & C. Srisuwanrat

Solution 10.2 Problem 10.2 Leveling the following network using PACK
Activity
A
B
C
D
E
F
G
H
I
J

CEE536Example Problems

Predecessors

Duration
2
3
5
2
4
3
10
4
2
3

A
A
B
B
C
C
E
E,F
D,H,I,G

174

Resource Rate
7
2
2
3
1
2
2
5
3
6

P.G. Ioannou & C. Srisuwanrat

SQS

RES

AC

JC

4
2
3
3
3
4
4

DUR

ACT

11

10

1
2
5
3

1
1
1
1

4
5
4
5

4
3
4
2

10

11

12

13

14

15

16

17

F
H
I

No

RS

E
2

4
7

4
4

7
5

18

19

20

4
4

RIC = 1.0744

CEE536Example Problems

175

P.G. Ioannou & C. Srisuwanrat

PROCESSING QUEUE

ACT
AC =
DUR =
Assign to day

H
4
4
10-13

H
Assign.
10-13
11-14
12-15
13-16
14-17

No

ACT

RES

TF

SQS

3
4
5
6

D
B
F
E

3
2
2
1

10
4
5
4

3
3
3
3

RS(J)
8
8
8
8
8

E
Assign.
6-9
6-9
6-9
6-9
6-9

minRS(J)
8
8
8
8
8

16
16
16
16
16

Since E is a predecessor of H and it must occupied day 6-9 no matter what, you can assign activity E into the resource profile right the way.
ACT
E
E

AC =
0
Assign.
RS(J)
DUR =
4
6-9
8
8
Assign to day

6-9

CEE536Example Problems

176

P.G. Ioannou & C. Srisuwanrat

ACT
AC =
DUR =
Assign to day

I
5
2
16-17

I
Assign.
11-12
12-13
13-14
14-15
15-16
16-17

RS(J)
14
14
9
4
4
4

ACT
AC =
DUR =
Assign to days

D
10
2
14-15

D
Assign.
6-7
7-8
8-9
9-10
10-11
11-12
12-13
13-14
14-15
15-16
16-17

RS(J)
6
6
6
10
14
14
14
9
4
7
10

B
0
3
3-5

B
Assign.
3-5

RS(J)
6

ACT
AC =
DUR =
Assign to days

CEE536Example Problems

F
Assign.
8-10
8-10
8-10
8-10
8-10
13-15

minRS(J)
13
13
13
13
13
11

27
27
22
17
17
15

6
6
6
10
14
14
14
9
4
7
10

177

P.G. Ioannou & C. Srisuwanrat

ACT
AC =
DUR =
Assign to days

F
5
3
8-10

CEE536Example Problems

F
Assign.
8-10
9-11
10-12
11-13
12-14
13-15

RS(J)
13
17
21
21
19
17

13
17
21
21
19
17

178

P.G. Ioannou & C. Srisuwanrat

Problem 10.3

CEE536Example Problems

179

P.G. Ioannou & C. Srisuwanrat

Problem 10.4

A
3
4

ACT
DUR
RES

CEE536Example Problems

B
3
2

E
6
4

C
7
3

F
2
6

D
2
2

F
8
6

180

G
4
2

P.G. Ioannou & C. Srisuwanrat

11.OVERLAPPING NETWORKS

11. OVERLAPPING NETWORK

Problem 11.1 Calculate ESD, EFD, TF, and FF

CEE536Example Problems

182

P.G. Ioannou & C. Srisuwanrat

Solution 11.1

CEE536Example Problems

183

P.G. Ioannou & C. Srisuwanrat

Problem 11.2

20
D
17
0

5
A
3

35
G
4
17

10
B
7

25
E
6

15
C
10

30
F
14

15

19

40
H
15

45
K
2

Solution 11.2

CEE536Example Problems

184

P.G. Ioannou & C. Srisuwanrat

0
-5

Dummy
Start
0

0
-1

5
A
3
0

6,1
5,1

3
15

20
D
17
0

17
12

7
6

2
12

5,5
0,0

0
-6

12

19

10
4

15
C
10
3

CEE536Example Problems

3,0
3,0

35
G
4
17

15

8
18

5
9

25
E
6

10
B
7
3

0,0
0,0

7,4
3,1

7
19

0,0
0,0

19

20
24

27
24

40
H
15
25

12

3,3
0,0

29
26
45
K
2

27

27

0,0
0,0

29

18
30
F
14

13

3,0
3,0

185

21

P.G. Ioannou & C. Srisuwanrat

Problem 11.3

CEE536Example Problems

186

P.G. Ioannou & C. Srisuwanrat

Solution 11.3

CEE536Example Problems

187

P.G. Ioannou & C. Srisuwanrat

Problem 11.4

10
A
4

CEE536Example Problems

15
B
8

30
E
3

20
C
6

35
F
7

45
H
6

25
D
6

40
G
15

50
M
10

188

55
N
4

P.G. Ioannou & C. Srisuwanrat

Solution 11.4
3

11

11
11

15
B
8
0

10
A
4
0

0,0
0,0

-1
0

11

5
6
-3

6
0

CEE536Example Problems

6,2
4,2

0,0
0,0

14
12
13
4

11
8

35
F
7
6

5
6

-2
0

25
D
6

Dummy
Start
0

30
E
3

20
C
6

0,0
0,0

0,0
0,0

14
14

1,0
1,0

4,4
0,0

189

15
11

14

11

8
15

8
2

0,0
0,0

19
15
55
N
4

45
H
6

40
G
15
12

17
14

17

18
12

15

0,0
0,0

19

50
M
10
19

1,1
0,0

19

19
Dummy
Finish

19

19

0,0
0,0

19

P.G. Ioannou & C. Srisuwanrat

Problem 11.5

CEE536Example Problems

190

P.G. Ioannou & C. Srisuwanrat

Solution 11.5

CEE536Example Problems

191

P.G. Ioannou & C. Srisuwanrat

12.REPETITIVE SCHEDULING METHOD

REPETITIVE SCHEDULING METHOD (RSM)

Problem 12.1
This project consists of 5 units requiring 7 activities.
Construct RSM diagram of the following project
Determine critical activities
Identify controlling sequence
Identify resource critical activities

1
2
3
4
5
6
7

Activity
A
B
C
D
E
F
G

Predecessors
A
B
C
D
E
F

CEE536Example Problems

Duration/Unit
2
1
3
2
1
2
1

193

P.G. Ioannou & C. Srisuwanrat

Solution 12.1

G5
G4

F3

G2

F2

G1

F1

E2
E1

G3

F4

E4
E3

D3

F5

E5

D5

D4

C4
D2

C1

D1

C2

B2

A2

B1

A1

C3

B3

A3

B4

A4

B5

A5

Unit

C5

Critical Activities= {G5-1, F5-1, E1} , Controlling Sequence= {G5, F5-1, E2-4, D5, C5-1, B2-4, A5-1}
Resource Critical= {Critical Activity} {Controlling Sequence} = {G4-1, E1}

Days
0

CEE536Example Problems

10

12

14

16

194

18

20

22

24

26

28

30

P.G. Ioannou & C. Srisuwanrat

Problem 12.2
This project consists of 3 units requiring 7 activities.
Construct RSM diagram of the following project
Determine critical activities
Identify controlling sequence
Identify resource critical activities

1
2
3
4
5
6
7

Activity
A
B
C
D
E
F
G

Predecessors
A
A
B, C
D
D
E, F

CEE536Example Problems

Duration/Unit
2
3
2
4
4.333
1
4

195

P.G. Ioannou & C. Srisuwanrat

Solution 12.2
Critical Activities: {G3-1, F1} , Controlling Sequence: {G3-1, F2, D3-1, B1, A1}
Resource Critical= {Critical Activity} {Controlling Sequence} = {F1}

CEE536Example Problems

3
G

G
1

F1

B1

E1

G
2

F2

2
D
1

C1

A1

E3

F3

D
3

C3

B3

E2

C2

A2

A3

B2

Unit

Days
6

10

12

14

196

16

18

20

22

24

26

28

P.G. Ioannou & C. Srisuwanrat

Problem 12.3
This project consists of 5 units requiring 7 activities.
Construct RSM diagram of the following project
Determine critical activities
Identify controlling sequence
Identify resource critical activities

1
2
3
4
5
6
7

Activity
A
B
C
M
D
E
F

Predecessors
A
A
C
B
M, D
E

CEE536Example Problems

Duration/Unit
3
5
1
2
2
2
3

197

P.G. Ioannou & C. Srisuwanrat

CEE536Example Problems

198

E5

E4

E3

E2

E1

D1

M1

M2

D2

M3

D3

D4

M4

D5

M5

Solution 12.3

P.G. Ioannou & C. Srisuwanrat