Scheduling & Prioritization

Scheduling and prioritisation algorithms determine the order in which tasks are processed when resources are limited. Key heuristics: Earliest Due Date (EDD) minimises maximum lateness; Shortest Processing Time (SPT) minimises average completion time; Weighted Shortest Job First (WSJF) maximises value throughput by dividing value by duration. Each solves a different objective. The insight for founders: how you order work matters as much as what work you do. Default ordering (FIFO, loudest voice) often destroys value. Picking the right scheduling rule for your objective — speed, value, fairness — is a leverage decision.

Define the objective: minimise lateness? Maximise value throughput? Minimise total wait time? Then pick the matching rule: EDD for deadlines, SPT for throughput, WSJF for value delivery. Apply it to the backlog. Re-prioritise when new work arrives or objectives change.

Scheduling algorithms order work to match an objective: EDD minimises lateness, SPT minimises average completion, WSJF maximises value throughput. Choose the rule that matches your goal, apply it to the backlog, and resist ad hoc ordering.