Coaching Centre
Chapter 9: Network Flow and Critical Path Analysis Notes
Turning an activity chart into a network with dummy activities, forward and backward scanning, float, critical paths and Gantt charts, then flow networks, cuts and the maximum-flow minimum-cut theorem.
Sections
-
9A Activity charts and network diagrams Mastered
Reading an activity chart (precedence table), immediate predecessors, drawing an activity-on-arc network, and using a dummy activity when two activities share some but not all of their predecessors.
-
9B Forward and backward scanning Mastered
Earliest starting times (EST) by forward scanning, the minimum completion time, and latest starting times (LST) by backward scanning, with the largest-in, smallest-out rules.
-
9C Float, critical paths and Gantt charts Mastered
Float time for each activity, critical activities and the critical path, the effect of changing a duration, drawing a Gantt chart from a network, and a spreadsheet model of a project.
-
9D Flow networks and maximum flow Mastered
The language of flow networks (source, sink, capacity, flow), drawing a network from a table, the rules every flow must obey, and finding the maximum flow by sending flow along paths.
-
9E Cuts and the max-flow min-cut theorem Mastered
Cuts in a flow network, finding the capacity of a cut (forward edges only), the maximum-flow minimum-cut theorem, and using it to judge upgrades and whether a network can meet demand.