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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Ebenlendr, T., Noga, J., Sgall, J., & Woeginger, G. (2006). A note on semi-online machine covering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3879 LNCS, pp. 110–118). https://doi.org/10.1007/11671411_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
