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.
```svg
```
**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 |