On the configuration-LP for scheduling on unrelated machines
- 355 Downloads
Closing the approximability gap between \(3/2\) and 2 for the minimum makespan problem on unrelated machines is one of the most important open questions in scheduling. Almost all known approximation algorithms for the problem are based on linear programs (LPs). In this paper, we identify a surprisingly simple class of instances which constitute the core difficulty for LPs: the so far hardly studied unrelated graph balancing case in which each job can be assigned to at most two machines. We prove that already for this basic setting the strongest LP-relaxation studied so far—the configuration-LP—has an integrality gap of 2, matching the best known approximation factor for the general case. This points toward an interesting direction of future research. For the objective of maximizing the minimum machine load in the unrelated graph balancing setting, we present an elegant purely combinatorial 2-approximation algorithm with only quadratic running time. Our algorithm uses a novel preprocessing routine that estimates the optimal value as good as the configuration-LP. This improves on the computationally costly LP-based algorithm by Chakrabarty et al. (Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS 2009), pp 107–116, 2009) that achieves the same approximation guarantee.
KeywordsMachine scheduling Integrality gap Configuration-LP Approximation algorithms
This work was partially supported by Berlin Mathematical School (BMS), by the DFG Focus Program 1307 within the project “Algorithm Engineering for Real-time Scheduling and Routing,” by FONDECYT project 3130407, and by Nucleo Milenio Información y Coordinación en Redes ICM/FIC P10-024F.
- Asadpour, A., Feige, U., & Saberi, A. (2008). Santa Claus meets hypergraph matchings. In Proceedings of the 11th International Workshop and 12th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX-RANDOM 2008). LNCS (Vol. 5171, pp. 10–20). Berlin: Springer.Google Scholar
- Asadpour, A., Feige, U., & Saberi, A. (2012). Santa Claus meets hypergraph matchings. ACM Transactions on Algorithms, 8, Art. No. 24.Google Scholar
- Bansal, N., & Sviridenko, M. (2006). The Santa Claus problem. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC 2006) (pp. 31–40).Google Scholar
- Bateni, M., Charikar, M., & Guruswami, V. (2009). Maxmin allocation via degree lower-bounded arborescences. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC 2009) (pp. 543–552).Google Scholar
- Chakrabarty, D., Chuzhoy, J., & Khanna, S. (2009). On allocating goods to maximize fairness. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS 2009) (pp. 107–116).Google Scholar
- Ebenlendr, T., Krčál, M., & Sgall, J. (2008). Graph balancing: A special case of scheduling unrelated parallel machines. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008) (pp. 483–490).Google Scholar
- Ebenlendr, T., Krčál, M., & Sgall, J. (2012). Graph balancing: A special case of scheduling unrelated parallel machines. Algorithmica 1–19. doi: 10.1007/s00453-012-9668-9.
- Feige, U. (2008). On allocations that maximize fairness. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008) (pp. 287–293).Google Scholar
- Haeupler, B., Saha, B., & Srinivasan, A. (2011). New constructive aspects of the Lovász local lemma. Journal of the ACM, 58, Art. No. 28.Google Scholar
- Horowitz, E., & Sahni, S. (April 1976). Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM, 23, 317–327.Google Scholar
- Karmarkar, N., & Karp, R. M. (1982). An efficient approximation scheme for the one-dimensional bin-packing problem. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 1982) (pp. 312–320).Google Scholar
- Lin, J.-H., & Vitter, J. S. (1992). epsilon-Approximations with minimum packing constraint violation. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC 1992) (pp. 771– 782).Google Scholar
- Svensson, O. (2012). Santa Claus schedules jobs on unrelated machines. SIAM Journal on Computing, 41, 1318–1341. Google Scholar
- Verschae, J., & Wiese, A. (2011). On the configuration-LP for scheduling on unrelated machines. In Proceedings of the 19th European Symposium on Algorithms (ESA 2011). Lecture Notes in Computer Science (Vol. 6942, pp. 530–542). Berlin: Springer.Google Scholar