A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges

Authors Chien-Chung Huang, Sebastian Ott

Thumbnail PDF


  • Filesize: 0.51 MB
  • 15 pages

Document Identifiers

Author Details

Chien-Chung Huang
Sebastian Ott

Cite AsGet BibTex

Chien-Chung Huang and Sebastian Ott. A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 49:1-49:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Makespan minimization in restricted assignment (R|p_{ij} in {p_j, infinity}|C_{max}) is a classical problem in the field of machine scheduling. In a landmark paper, [Lenstra, Shmoys, and Tardos, Math. Progr. 1990] gave a 2-approximation algorithm and proved that the problem cannot be approximated within 1.5 unless P=NP. The upper and lower bounds of the problem have been essentially unimproved in the intervening 25 years, despite several remarkable successful attempts in some special cases of the problem recently. In this paper, we consider a special case called graph-balancing with light hyper edges, where heavy jobs can be assigned to at most two machines while light jobs can be assigned to any number of machines. For this case, we present algorithms with approximation ratios strictly better than 2. Specifically, - Two job sizes: Suppose that light jobs have weight w and heavy jobs have weight W, and w < W. We give a 1.5-approximation algorithm (note that the current 1.5 lower bound is established in an even more restrictive setting). Indeed, depending on the specific values of w and W, sometimes our algorithm guarantees sub-1.5 approximation ratios. - Arbitrary job sizes: Suppose that W is the largest given weight, heavy jobs have weights in the range of (beta W, W], where 4/7 <= beta < 1, and light jobs have weights in the range of (0,beta W]. We present a (5/3+beta/3)-approximation algorithm. Our algorithms are purely combinatorial, without the need of solving a linear program as required in most other known approaches.
  • Approximation Algorithms
  • Machine Scheduling
  • Graph Balancing
  • Combinatorial Algorithms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, and Kouhei Zenmyo. Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim., 22(1):78-96, 2011. Google Scholar
  2. Deeparnab Chakrabarty, Sanjeev Khanna, and Shi Li. On (1,ε)-restricted assignment makespan minimization. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'15), pages 1087-1101. SIAM, 2015. Google Scholar
  3. T. Ebenlendr, M. Krčál, and J. Sgall. Graph balancing: A special case of scheduling unrelated parallel machines. Algorithmica, 68:62-80, 2014. Google Scholar
  4. Tomáš Ebenlendr, Marek Krčál, and Jiří Sgall. Graph balancing: A special case of scheduling unrelated parallel machines. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), pages 483-490. SIAM, 2008. Google Scholar
  5. M. Gairing, T. Lücking, M. Mavronicolas, and B. Monien. Computing nash equilibria for scheduling on restricted parallel links. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04), pages 613-622. ACM, 2004. Google Scholar
  6. M. Gairing, B. Monien, and A. Wocalw. A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci., 380(1-2):87-99, 2007. Google Scholar
  7. Chien-Chung Huang and Sebastian Ott. A combinatorial approximation algorithm for graph balancing with light hyper edges. CoRR, abs/1507.07396, 2015. Google Scholar
  8. S. G. Kolliopoulos and Y. Moysoglou. The 2-valued case of makespan minimization with assignment constraints. Information Processing Letters, 113(1-2):39-43, 2013. Google Scholar
  9. J.K. Lenstra, D.B. Shmoys, and É. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:256-271, 1990. Google Scholar
  10. J.Y. Leung and C. Li. Scheduling with processing set restrictions: A survey. International Journal of Production Economics, 116:251-262, 2008. Google Scholar
  11. J. Sgall. Private communication, 2015. Google Scholar
  12. E. V. Shchepin and N. Vakhania. An optimal rounding gives a better approximation for scheduling unrelated machines. Oper. Res. Lett., 33(2):127-133, 2005. Google Scholar
  13. O. Svensson. Santa claus schedules jobs on unrelated machines. SIAM J. Comput., 41(5):1318-1341, 2012. Google Scholar
  14. J. Verschae and A. Wiese. On the configuration-lp for scheduling on unrelated machines. J. Scheduling, 17(4):371-383, 2014. Google Scholar
  15. D. P. Willamson and D.B. Shmoys. The design of approximation algorithms. Cambridge University Press, 2010. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail