@inproceedings{79106f48dba247b893bd0b90e28ebeee,
title = "A note on semi-online machine covering",
abstract = "In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm is given in advance the optimal value of the smallest load for the given instance, and then the jobs are scheduled one by one as they arrive, without any knowledge of the following jobs.We present a deterministic algorithm with competitive ratio 11/6 = 1.834 for machine covering with any number of machines and a lower bound showing that no deterministic algorithm can have a competitive ratio below 43/24 = 1.791.",
author = "T. Ebenlendr and J. Noga and J. Sgall and G.J. Woeginger",
year = "2006",
doi = "10.1007/11671411\_9",
language = "English",
isbn = "3-540-32207-8",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "110--118",
editor = "T. Erlebach and G. Persinao",
booktitle = "Approximation and Online Algorithms (3rd International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised selected papers)",
address = "Germany",
}