Closing the Gap for Makespan Scheduling via Sparsification Techniques

Authors Klaus Jansen, Kim-Manuel Klein, José Verschae

Thumbnail PDF


  • Filesize: 0.53 MB
  • 13 pages

Document Identifiers

Author Details

Klaus Jansen
Kim-Manuel Klein
José Verschae

Cite AsGet BibTex

Klaus Jansen, Kim-Manuel Klein, and José Verschae. Closing the Gap for Makespan Scheduling via Sparsification Techniques. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 72:1-72:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Makespan scheduling on identical machines is one of the most basic and fundamental packing problem studied in the discrete optimization literature. It asks for an assignment of n jobs to a set of m identical machines that minimizes the makespan. The problem is strongly NPhard, and thus we do not expect a (1 + epsilon)-approximation algorithm with a running time that depends polynomially on 1/epsilon. Furthermore, Chen et al. [Chen/JansenZhang, SODA'13] recently showed that a running time of 2^{1/epsilon}^{1-delta} + poly(n) for any delta > 0 would imply that the Exponential Time Hypothesis (ETH) fails. A long sequence of algorithms have been developed that try to obtain low dependencies on 1/epsilon, the better of which achieves a running time of 2^{~O(1/epsilon^{2})} + O(n*log(n)) [Jansen, SIAM J. Disc. Math. 2010]. In this paper we obtain an algorithm with a running time of 2^{~O(1/epsilon)} + O(n*log(n)), which is tight under ETH up to logarithmic factors on the exponent. Our main technical contribution is a new structural result on the configuration-IP. More precisely, we show the existence of a highly symmetric and sparse optimal solution, in which all but a constant number of machines are assigned a configuration with small support. This structure can then be exploited by integer programming techniques and enumeration. We believe that our structural result is of independent interest and should find applications to other settings. In particular, we show how the structure can be applied to the minimum makespan problem on related machines and to a larger class of objective functions on parallel machines. For all these cases we obtain an efficient PTAS with running time 2^{~O(1/epsilon)} + poly(n).
  • scheduling
  • approximation
  • PTAS
  • makespan
  • ETH


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


  1. N. Alon, Y. Azar, G. Woeginger, and T. Yadid. Approximation schemes for scheduling. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '97), pages 493-500. ACM/SIAM, 1997. Google Scholar
  2. N. Alon, Y. Azar, G. J. Woeginger, and T. Yadid. Approximation schemes for scheduling on parallel machines. Journal of Scheduling, 1:55-66, 1998. Google Scholar
  3. L. Chen, K. Jansen, and G. Zhang. On the optimality of approximation schemes for the classical scheduling problem. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13), pages 657-668. ACM/SIAM, 2013. Google Scholar
  4. F. Eisenbrand and G. Shmonin. Carathéodory bounds for integer cones. Operations Research Letters, 34:564-568, 2006. Google Scholar
  5. M. X. Goemans and T. Rothvoß. Polynomiality for bin packing with a constant number of item types. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'14), pages 830-839. ACM/SIAM, 2014. Google Scholar
  6. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563-1581, 1966. Google Scholar
  7. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17:416-429, 1969. Google Scholar
  8. D. Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing Company, 1997. Google Scholar
  9. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM, 34:144-162, 1987. Google Scholar
  10. K. Jansen. An EPTAS for scheduling jobs on uniform processors: Using an MILP relaxation with a constant number of integral variables. SIAM Journal on Discrete Mathematics, 24:457-485, 2010. Google Scholar
  11. K. Jansen and C. Robenek. Scheduling jobs on identical and uniform processors revisited. In Approximation and Online Algorithms (WAOA'11), number 7164 in Lecture Notes in Computer Science, pages 109-122. Springer, 2011. Google Scholar
  12. R. Kannan. Minkowski’s convex body theorem and integer programming. Mathematics of Operations Research, 12:415-440, 1987. Google Scholar
  13. H. W. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8:538-548, 1983. Google Scholar
  14. J. Y-T. Leung. Bin packing with restricted piece sizes. Information Processing Letters, 31:145-149, 1989. Google Scholar