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 viewBox="0 0 452 302" xmlns="http://www.w3.org/2000/svg" style="max-width:100%;height:auto" role="img"><rect x="0" y="0" width="452" height="302" rx="12" fill="#0d1117"/><g font-family="ui-monospace,SFMono-Regular,Menlo,Consolas,&quot;Liberation Mono&quot;,monospace" font-size="14"><text xml:space="preserve" x="20" y="31.7"><tspan fill="#c9d1d9">EDD Scheduling Example:</tspan></text><text xml:space="preserve" x="20" y="50.7"><tspan fill="#c9d1d9">Jobs:   A      B      C      D</tspan></text><text xml:space="preserve" x="20" y="69.7"><tspan fill="#c9d1d9">Due:    Day 5  Day 2  Day 8  Day 3</tspan></text><text xml:space="preserve" x="20" y="88.7"><tspan fill="#c9d1d9">Time:   2      1      3      2</tspan></text><text xml:space="preserve" x="20" y="107.7"></text><text xml:space="preserve" x="20" y="126.7"><tspan fill="#c9d1d9">EDD Order: B </tspan><tspan fill="#6e7681">→</tspan><tspan fill="#c9d1d9"> D </tspan><tspan fill="#6e7681">→</tspan><tspan fill="#c9d1d9"> A </tspan><tspan fill="#6e7681">→</tspan><tspan fill="#c9d1d9"> C</tspan></text><text xml:space="preserve" x="20" y="145.7"><tspan fill="#c9d1d9">           Due Day 2 </tspan><tspan fill="#6e7681">→</tspan><tspan fill="#c9d1d9"> 3 </tspan><tspan fill="#6e7681">→</tspan><tspan fill="#c9d1d9"> 5 </tspan><tspan fill="#6e7681">→</tspan><tspan fill="#c9d1d9"> 8</tspan></text><text xml:space="preserve" x="20" y="164.7"></text><text xml:space="preserve" x="20" y="183.7"><tspan fill="#c9d1d9">Timeline:</tspan></text><text xml:space="preserve" x="20" y="202.7"><tspan fill="#c9d1d9">Day:  1   2   3   4   5   6   7   8</tspan></text><text xml:space="preserve" x="20" y="221.7"><tspan fill="#c9d1d9">      B</tspan><tspan fill="#6e7681">─┤</tspan><tspan fill="#c9d1d9"> D</tspan><tspan fill="#6e7681">───┤</tspan><tspan fill="#c9d1d9"> A</tspan><tspan fill="#6e7681">───┤</tspan><tspan fill="#c9d1d9"> C</tspan><tspan fill="#6e7681">─────┤</tspan></text><text xml:space="preserve" x="20" y="240.7"><tspan fill="#c9d1d9">      Done:D2  D4   D6     D9</tspan></text><text xml:space="preserve" x="20" y="259.7"><tspan fill="#c9d1d9">      Due: D2  D3   D5     D8</tspan></text><text xml:space="preserve" x="20" y="278.7"><tspan fill="#c9d1d9">      Late: 0   1    1      1  </tspan><tspan fill="#6e7681">←</tspan><tspan fill="#c9d1d9"> Max lateness = 1</tspan></text></g></svg>

EDD vs. Other Scheduling Rules: