PERT/CPM

PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I.

6
E

time

PERT/CPM
Algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v.

earliest finish time

0
D

0
F

6 5 0
A

0
E

0
B

0
C

0
G

0
H

0
I

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

0
D

0
F

6 5 0
A

0
E

4 0 X
B

0
C

0
G

0
H

0
I

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

10 0 X
D

0
F

6 5

0
E

0
A

4 0 X
B

6 X 0
C

0
G

0
H

0
I

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

10 0 X
D

0
F

6 5

0
E

0
A

4 0 X
B

6 X 0
C

10 0 X
G

12 0 X
H

0
I

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

10 0 X
D

13 0 X
F

15 0 X
E

0
A

4 0 X
B

6 X 0
C

10 0 X
G

12 0 X
H

0
I

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

10 0 X
D

13 0 X
F

15 0 X
E

0
A

4 0 X
B

6 X 0
C

10 X 19 0 X
G

12 X 21 0 X
H

0
I

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

10 0 X
D

13 0 X
F

15 0 X
E

0
A

4 0 X
B

6 X 0
C

10 X 19 0 X
G

12 X 21 0 X
H

13 0 X
I

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

10 0 X
D

13 0 X
F

15 0 X
E

0
A

4 0 X
B

6 X 0
C

10 X 19 0 X
G

12 X 21 X 25 0 X
H

13 0 X
I

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

10 0 X
D

13 0 X
F

15 0 X
E

0
A

4 0 X
B

6 X 0
C

10 X 19 0 X
G

12 X 21 X 25 0 X
H

13 X 25 0 X
I

10

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

10 0 X
D

13 0 X
F

15 0 X
E

0
A

4 0 X
B

6 X 0
C

10 X 19 0 X
G

12 X 21 X 25 0 X
H

13 X 25 0 X
I

11

PERT/CPM
PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I. Initialize fin[v] = 0 for all vertices v. Consider vertices v in topological order: for each edge v-w, set fin[w] = max(fin[w], fin[v] + time[w])

10
D

13
F

6 critical path 0
A

15
E

5 6
C

4
B

19
G

25
H

25
I

12