@inbook{02561bf553a541c191e31d200658c339,
title = "Optimal on-line algorithms to minimize makespan on two machines with resource augmentation",
abstract = "We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider three versions of this problem: preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling. For all these cases we design algorithms with best possible competitive ratios as a function of the machine speeds.",
author = "Leah Epstein and Arik Ganot",
year = "2004",
doi = "10.1007/978-3-540-24592-6_9",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "109--122",
editor = "Klaus Jansen and Roberto Solis-Oba",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}