Earliest Due Date

Earliest Due Date (EDD) is a scheduling algorithm that prioritizes jobs based on their due dates, processing the job with the nearest deadline first.

## What Is EDD Scheduling?

  • Rule: Sort jobs by due date, process earliest due first
  • Objective: Minimize maximum lateness (tardiness of latest job)
  • Optimality: EDD is optimal for single-machine maximum lateness
  • Limitation: Does not consider processing time or job importance

## Why EDD Matters

In time-sensitive manufacturing, meeting delivery commitments is critical. EDD provides a simple, provably optimal rule for deadline-driven scheduling.

EDD Scheduling Example:Jobs: A B C DDue: Day 5 Day 2 Day 8 Day 3Time: 2 1 3 2EDD Order: B → D → A → C Due Day 2 → 3 → 5 → 8Timeline:Day: 1 2 3 4 5 6 7 8 B─┤ D───┤ A───┤ C─────┤ Done:D2 D4 D6 D9 Due: D2 D3 D5 D8 Late: 0 1 1 1 ← Max lateness = 1

EDD vs. Other Scheduling Rules:
| Rule | Objective | Optimal For |
|------|-----------|-------------|
| EDD | Min max lateness | Single machine |
| SPT | Min total flow time | Mean completion |
| WSPT | Min weighted flow | Weighted jobs |
| Critical ratio | Balance due date vs. remaining work | Dynamic |

Take earliest due date further

Ask the copilot about this term, or have our engineers assess it against your process.

Ask CFSGPT about this → Request a technical assessment → Open the CFS app