Abstract
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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Uthaisombut, P. (2004). The optimal online algorithms for minimizing maximum lateness. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3111, 420–430. https://doi.org/10.1007/978-3-540-27810-8_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
