lesson
Updated 6 days ago · 1 view
If a custom laser-cut chassis takes three days to arrive while you spend five days coding the microcontroller, does a one-day delay in shipping delay your final prototype delivery?
It turns out some tasks have wiggle room, while others will instantly push back your entire completion deadline if delayed by even a single hour.
The Project Network Node
In the late 1950s, chemical giant DuPont developed Critical Path Analysis (CPA) to schedule complex maintenance operations without costly plant downtime.
A critical path network breaks a design project into distinct activities connected by arrows to show dependencies. Each task is drawn as a standard node box split into key timing values.
📊Interactive/clean SVG diagram of a standard Activity Node used in Critical Path Analysis. A rectangular box with rounded corners divided into 4 regions: Top-Left: Earliest Start Time (EST) labeled in blue '#2563eb', Top-Right: Latest Finish Time (LFT) labeled in red '#dc2626', Center: Activity Name/Description labeled in dark bold font '#1e2945', Bottom: Duration (in days) labeled in purple '#7c3aed'. Callout lines point to each quadrant with brief 1-sentence explanations. Clean white background '#ffffff', subtle gray border '#e2e8f0', light blue and red highlights.
The Earliest Start Time (EST) is the soonest a task can begin after all preceding tasks finish, while the Latest Finish Time (LFT) is the latest moment it can finish without delaying the overall project.
How do we calculate the exact numbers that go inside every node?
The Forward Pass: Finding EST
To find each task's EST, we move from left to right through the network starting at day 0 in a process called the forward pass.
For a single dependency, the new EST is simply the previous EST+Duration. When two or more paths converge, the task cannot start until the slowest path finishes, so you must take the maximum value.
📊Step-by-step animated network showing a Forward Pass with 3 nodes (A, B, C) converging into Node D. Task A (Duration: 3, EST: 0 -> Finish: 3). Task B (Duration: 5, EST: 0 -> Finish: 5). Task C (Duration: 2, EST: 0 -> Finish: 2). Node D shows a decision highlighting max(3, 5, 2) = 5. Therefore Node D EST = 5. Visual arrows in bright blue '#2563eb' point toward Node D with clear mathematical annotation 'EST_D = max(0+3, 0+5, 0+2) = 5'. Clean white cards, light gray backdrop.
Once you reach the final milestone and know the overall project duration, how do you determine the absolute latest deadline for each individual step?