LIPIcs.SWAT.2016.24.pdf
- Filesize: 0.55 MB
- 13 pages
Document
Estimating The Makespan of The Two-Valued Restricted Assignment Problem
Authors
-
Part of:
Volume:
15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-06-22
Cite AsGet BibTex
Klaus Jansen, Kati Land, and Marten Maack. Estimating The Makespan of The Two-Valued Restricted Assignment Problem. In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 53, pp. 24:1-24:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.SWAT.2016.24
https://doi.org/10.4230/LIPIcs.SWAT.2016.24
Abstract
We consider a special case of the scheduling problem on unrelated machines, namely the Restricted Assignment Problem with two different processing times. We show that the configuration LP has an integrality gap of at most 5/3 ~ 1.667 for this problem. This allows us to estimate the optimal makespan within a factor of 5/3, improving upon the previously best known estimation algorithm with ratio 11/6 ~ 1.833 due to Chakrabarty, Khanna, and Li.
Keywords
- unrelated scheduling
- restricted assignment
- configuration LP
- integrality gap
- estimation algorithm
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Nikhil Bansal and Maxim Sviridenko. The santa claus problem. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, (STOC 2006), pages 31-40, 2006.
-
Deeparnab Chakrabarty, Sanjeev Khanna, and Shi Li. On (1, epsilon)-restricted assignment makespan minimization. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pages 1087-1101, 2015.
-
Tomáš Ebenlendr, Marek Krčál, and Jiří Sgall. Graph balancing: A special case of scheduling unrelated parallel machines. Algorithmica, 68(1):62-80, 2014.
-
Chien-Chung Huang and Sebastian Ott. A combinatorial approximation algorithm for graph balancing with light hyper edges. CoRR, abs/1507.07396, 2015.
-
Stavros G Kolliopoulos and Yannis Moysoglou. The 2-valued case of makespan minimization with assignment constraints. Information Processing Letters, 113(1):39-43, 2013.
-
Jan Karel Lenstra, David B Shmoys, and Éva Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming, 46(1-3):259-271, 1990.
-
Evgeny V. Shchepin and Nodari Vakhania. An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters, 33(2):127-133, 2005.
-
David B Shmoys and Éva Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62(1-3):461-474, 1993.
-
Ola Svensson. Santa claus schedules jobs on unrelated machines. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC 2011), pages 617-626, 2011.