demo-pert - 1 PERT/CPM PERT/CPM algorithm. Compute...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 PERT/CPM PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I . A B C G H D E F I 4 6 2 5 3 4 6 time 2 PERT/CPM Algorithm. Compute topological order of vertices: A B C D E F G H I . Initialize fin[v] = for all vertices v . A B C G H D E F I 4 6 2 5 3 4 6 earliest finish time 3 PERT/CPM PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I . Initialize fin[v] = 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]) A B C G H D E F I 4 6 2 5 3 4 6 X 4 4 PERT/CPM PERT/CPM algorithm. Compute topological order of vertices: A B C D E F G H I . Initialize fin[v] = 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]) A B C G H D E F I 4 6 2 5 3 4 6 X 4 X 10 X 6 5...
View Full Document

This note was uploaded on 06/25/2009 for the course MATH MAT 400 taught by Professor Jamespotvein during the Fall '08 term at University of Toronto- Toronto.

Page1 / 12

demo-pert - 1 PERT/CPM PERT/CPM algorithm. Compute...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online