负载均衡：从理论到实践的漫长道路
Load Balancing: The Long Road from Theory to Practice
摘要：
对于在相同机器上最小化完工时间的工件排序问题，近似方法有着悠久的历史。这样的方案为每个$ε> 0$授予$(1+ε)$近似解，但是运行时间在$1/ε$中呈指数增长。在很长一段时间里，这些计划似乎是一个纯粹的理论概念。甚至解决$ε$的中等值的实例似乎完全是虚幻的。在努力弥合理论和实践，我们完善最近的ILP技术，开发最快的已知近似方案，这个问题。该算法的实现在合理的时间跨度内达到低于$2/11\approx 18.2\%$的$ε$值。这是MULTIFIT的近似保证，据我们所知，它具有任何非模式算法的最佳证明保证。
英文摘要：
There is a long history of approximation schemes for the problem of scheduling jobs on identical machines to minimize the makespan. Such a scheme grants a $(1+ε)$-approximation solution for every $ε> 0$, but the running time grows exponentially in $1/ε$. For a long time, these schemes seemed like a purely theoretical concept. Even solving instances for moderate values of $ε$ seemed completely illusional. In an effort to bridge theory and practice, we refine recent ILP techniques to develop the fastest known approximation scheme for this problem. An implementation of this algorithm reaches values of $ε$ lower than $2/11\approx 18.2\%$ within a reasonable timespan. This is the approximation guarantee of MULTIFIT, which, to the best of our knowledge, has the best proven guarantee of any non-scheme algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
