Name
Abstract | ||
|---|---|---|
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+\epsilon)$-approximation solution for every $\epsilon > 0$, but the running time grows exponentially in $1/\epsilon$. For a long time, these schemes seemed like a purely theoretical concept. Even solving instances for moderate values of $\epsilon$ 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 $\epsilon$ 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. |
Year | DOI | Venue |
|---|---|---|
2024 | 10.1137/1.9781611977042.9 | Workshop on Algorithm Engineering and Experimentation (ALENEX) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastian Berndt | 1 | 9 | 9.13 |
| Max A. Deppert | 2 | 0 | 0.68 |
| Klaus Jansen | 3 | 789 | 82.68 |
| Lars Rohwedder | 4 | 7 | 6.26 |