Jansen, Klaus and Rohwedder, Lars
(2017)
*On the configuration-LP of the restricted assignment problem
*
[Paper]
In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , January 16 - 19, 2017, Barcelona, Spain.

## Abstract

We consider the classical problem of Scheduling on Unrelated Machines. In this problem a set of jobs is to be distributed among a set of machines and the maximum load (makespan) is to be minimized. The processing time pij of a job j depends on the machine i it is assigned to. Lenstra, Shmoys and Tardos gave a polynomial time 2-approximation for this problem [8]. In this paper we focus on a prominent special case, the Restricted Assignment problem, in which pij ∈ {pj, ∞}. The configuration-LP is a linear programming relaxation for the Restricted Assignment problem. It was shown by Svensson that the multiplicative gap between integral and fractional solution, the integrality gap, is at most 2 − 1/17 ≈ 1.9412 [11]. In this paper we significantly simplify his proof and achieve a bound of 2 − 1/6 ≈ 1.8333. As a direct consequence this provides a polynomial (2 − 1/6 + ϵ)-estimation algorithm for the Restricted Assignment problem by approximating the configuration-LP. The best lower bound known for the integrality gap is 1.5 and no estimation algorithm with a guarantee better than 1.5 exists unless P = NP.

Document Type: | Conference or Workshop Item (Paper) |
---|---|

Research affiliation: | Kiel University Kiel University > Kiel Marine Science OceanRep > The Future Ocean - Cluster of Excellence |

Date Deposited: | 19 Dec 2017 10:59 |

Last Modified: | 19 Dec 2017 10:59 |

URI: | http://eprints.uni-kiel.de/id/eprint/40883 |

### Actions (login required)

View Item |