Skip to content
Tutorials Center
My learning

Topics

Lesson 17 of 41 ยท Scheduling and Critical Path

Network Diagrams and Project Scheduling

Learn how to draw a project network diagram: nodes, dependencies, activity-on-node versus activity-on-arrow, start and end nodes, paths and the first steps of building a schedule.

Project scheduling answers three questions: in what order must the work happen, how long will it take, and when can each piece start and finish? The tool that makes the order visible is the network diagram. It shows activities as boxes (or arrows) connected by their dependencies, so you can see which activities can run in parallel and which must wait.

From activities to a network

You already know how to list activities and their dependencies (see Activities and Resources). Here is the running example used for the rest of this chapter: a small website project.

ID Activity Duration (days) Predecessors
A Requirements 5 none
B Design 7 A
C Database setup 6 A
D Front end 10 B
E Back end 12 B, C
F Integration 5 D, E
G Testing 6 F
H Deployment 2 G

Activity-on-node (AON)

In an activity-on-node diagram (also called the precedence diagramming method) each activity is a box and arrows show dependencies. It is the dominant style today because it supports all four dependency types (FS, SS, FF, SF) and software tools use it.

flowchart LR
    S((Start)) --> A["A: Requirements 5"]
    A --> B["B: Design 7"]
    A --> C["C: Database 6"]
    B --> D["D: Front end 10"]
    B --> E["E: Back end 12"]
    C --> E
    D --> F["F: Integration 5"]
    E --> F
    F --> G["G: Testing 6"]
    G --> H["H: Deployment 2"]
    H --> X((End))

Activity-on-node diagram of the example. Every path from Start to End is a possible schedule driver.

Rules:

  • One start node and one end node (add dummy nodes if several activities have no predecessor or no successor).
  • No loops: an activity cannot depend, directly or indirectly, on itself.
  • Each box shows ID, name, duration, and often earliest and latest times.

Activity-on-arrow (AOA)

In activity-on-arrow (arrow diagramming) each activity is an arrow between event nodes (circles that mean "something has started or finished"). Dummy arrows with zero duration express dependencies that the geometry cannot. AOA is older and is mostly seen in textbooks and PERT charts; AON is easier to read and extend.

AON AOA
Activities are Nodes (boxes) Arrows
Dummy activities Not needed Sometimes needed
Dependency types All four Only finish-to-start
Modern tools Standard Rare

Paths

A path is a route from start to end through the network. The length of a path is the sum of its durations. The example has these paths:

Path Length
A-B-D-F-G-H 5+7+10+5+6+2 = 35
A-B-E-F-G-H 5+7+12+5+6+2 = 37
A-C-E-F-G-H 5+6+12+5+6+2 = 36

The project cannot finish faster than its longest path. That longest path is the critical path, studied in the next lesson. Even before computing it you can see that adding a person to Front end will not shorten the project much, because other paths are nearly as long.

Enumerating paths in code

Python List all paths and their lengths

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Detecting mistakes

Typical network errors: a missing predecessor (an activity floating free), a circular dependency, or a dangling end (an activity with no successor that is not the final one). Code can check this.

Python Validate a network

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Leads, lags and other dependencies

Real networks use more than finish-to-start. Start-to-start with a lag models overlapping work: "Write user guide starts 3 days after Build starts". A lead lets a successor start before the predecessor ends. Use them sparingly; each makes the diagram harder to check.

Building the schedule step by step

  1. Create the activity list from the WBS.
  2. Identify dependencies and draw the network.
  3. Estimate durations (and resources).
  4. Run the forward and backward pass to get dates and float.
  5. Find the critical path.
  6. Adjust for resources and constraints; add a Gantt chart for communication.
  7. Baseline the schedule.

Tools such as Microsoft Project, Jira plans, or open-source schedulers calculate this automatically, but you need to understand the logic to catch mistakes.

Check your understanding

Quick check ยท 4 questions

of 4 answered You scored / 4 ยท perfect!

  1. 1. In an AON network diagram, activities are...

    Activity-on-node shows each activity as a node.
  2. 2. What is the length of a path?

    Path length is the total duration along the route.
  3. 3. Which is NOT allowed in a network diagram?

    A loop would mean an activity depends on itself, so it could never start.
  4. 4. Why is AON preferred today?

    AON is clearer and richer, and is what scheduling tools use.

Summary

  • A network diagram shows activities and their dependencies; AON puts activities in boxes.
  • Each start-to-end path has a length equal to the sum of its durations.
  • Check networks for strays, missing links and cycles.
  • The longest path decides the project duration.

Next: The Critical Path Method