liveBook · Manning

Latest finish time

As explained in Statistics Every Programmer Needs

A latest finish time is the latest point at which a project activity can be completed without delaying the project's completion.

Latest finish time (LF) is the latest point at which an activity can be completed without delaying the project's overall completion. It is determined during a backward pass through the activity network. section 13.3 section 13.3.2

Calculate and interpret LF through these relationships:

  • Set the final activity's LF to the project completion time, then move backward through the network. section 13.3.2
  • For an activity with one successor, set LF to that successor's latest start time. section 13.3.2
  • For multiple successors, use the minimum of their latest start times as the activity's LF. section 13.3.2
  • Calculate latest start time as LS = LF − activity duration; compare LF with earliest finish to determine finish-time slack. section 13.3.2 section 13.3.3

Automated reporting tool

The project finishes at week 29, so Activity L has LF = 29 and LS = 27 for its two-week duration. Activity K then has LF = 27 and LS = 24 for its three-week duration. Both activities have zero slack and lie on the critical path. section 13.3.2 section 13.3.3

Figure 13.3 A second visual representation of the automated reporting tool project plan. The new three-digit sequence for each activity represents, in order, the latest start time, the expected duration, and the latest finish time. A quick and easy way of distinguishing critical tasks from noncritical tasks is to compare the three-digit sequences: critical tasks have similar three-digit sequences, whereas noncritical tasks do not.
figure

Use the network diagram to compare latest-start, duration, and latest-finish sequences and distinguish critical from noncritical activities. section 13.3.2

How Statistics Every Programmer Needs covers it

How deep it goes
Defines LF, derives it through a backward pass, handles multiple successors, and connects it to latest start time and slack.
Examples
Uses Activities K and L in an automated reporting tool network and visualizes latest-time sequences in a project-plan diagram.
What it assumes
Assumes activity dependencies, expected durations, earliest times, and project completion time; teaches latest-time calculations from those inputs.
What you can do after
Apply it via a backward pass to calculate activity deadlines, slack, and critical-path membership.
How it connects
Connects latest finish time with backward pass, latest start time, earliest finish time, slack, and critical path method.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Statistics Every Programmer Needs. The section links point to the parts of the book it draws on.