The Optimal Online Algorithms for Minimizing Maximum Lateness

It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arrive over time on a single machine to minimize maximum lateness. It was not previously known what other online algorithms are optimal for this problem. A complete characterization of all optimal online algorithms for this problem is given.

• Type: Conference
• Year: 2004
• Where: SWAT
• Authors: Patchrawat Uthaisombut
• Keywords: Algorithms, Online Algorithms, Optimal Algorithms, SWAT 2004