Skip to main content
SpringerLink
Log in

Online Makespan Minimization with Parallel Schedules

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Online makespan minimization is a classical problem in which a sequence of jobs \(\sigma = J_1, \ldots , J_n\) has to be scheduled on m identical parallel machines so as to minimize the maximum completion time of any job. In this paper we investigate the problem with an essentially new model of resource augmentation. More specifically, an online algorithm is allowed to build several schedules in parallel while processing \(\sigma \). At the end of the scheduling process the best schedule is selected. This model can be viewed as providing an online algorithm with extra space, which is invested to maintain multiple solutions. The setting is of particular interest in parallel processing environments where each processor can maintain a single or a small set of solutions. As a main result we develop a \((4/3+\varepsilon )\)-competitive algorithm, for any \(0<\varepsilon \le 1\), that uses a constant number of schedules. The constant is equal to \(1/\varepsilon ^{O(\log (1/\varepsilon ))}\). We also give a \((1+\varepsilon )\)-competitive algorithm, for any \(0<\varepsilon \le 1\), that builds a polynomial number of \((m/\varepsilon )^{O(\log (1/\varepsilon ) / \varepsilon )}\) schedules. This value depends on m but is independent of the input \(\sigma \). The performance guarantees are nearly best possible. We show that any algorithm that achieves a competitiveness smaller than 4 / 3 must construct \(\Omega (m)\) schedules. Our algorithms make use of novel guessing schemes that (1) predict the optimum makespan of a job sequence \(\sigma \) to within a factor of \(1+\varepsilon \) and (2) guess the job processing times and their frequencies in \(\sigma \). In (2) we have to sparsify the universe of all guesses so as to reduce the number of schedules to a constant. We remark that the competitive ratios achieved using parallel schedules are considerably smaller than those in the standard problem without resource augmentation. Furthermore they are at least as good and in most cases better than the ratios obtained with other means of resource augmentation for makespan minimization.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Albers, S.: Better bounds for online scheduling. SIAM J. Comput. 29, 459–473 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Albers, S., Hellwig, M.: On the value of job migration in online makespan minimization. In: Proceedings of the 20th Annual European Symposium on Algorithms, Springer LNCS 7501, pp. 84–95 (2012)

  3. Angelelli, E., Nagy, A.B., Speranza, M.G., Tuza, Z.: The on-line multiprocessor scheduling problem with known sum of the tasks. J. Sched. 7, 421–428 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Angelelli, E., Speranza, M.G., Tuza, Z.: Semi-on-line scheduling on two parallel processors with an upper bound on the items. Algorithmica 37, 243–262 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Angelelli, E., Speranza, M.G., Tuza, Z.: New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete Math. Theor. Comput. Sci. 8, 1–16 (2006)

    MathSciNet  MATH  Google Scholar 

  6. Azar, Y.: On-line load balancing. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms: The State of the Art, vol. 1441, pp. 178–195. Springer, New York (1998)

    Chapter  Google Scholar 

  7. Azar, Y., Regev, O.: On-line bin-stretching. Theor. Comput. Sci. 268, 17–41 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bartal, Y., Karloff, H., Rabani, Y.: A better lower bound for on-line scheduling. Inf. Process. Lett. 50, 113–116 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. J. Comput. Syst. Sci. 51, 359–366 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bender, M.A., Slonim, D.K.: The Power of team exploration: two robots can learn unlabeled directed graphs. In: 35th Annual Symposium on Foundations of Computer Science, pp. 75–85 (1994)

  11. Blum, A., Chalasani, P.: An online algorithm for improving performance in navigation. SIAM J. Comput. 29, 1907–1938 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM J. Comput. 26, 110–137 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Böckenhauer, H.J., Komm, D., Královic, R., Královic, R.: On the advice complexity of the k-server problem. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming, Springer LNCS 6755, pp. 207–218 (2011)

  14. Böhm, M., Sgall, J., van Stee, R., Veselý, P.: Better algorithms for online bin stretching. In: Proceedings of the 12th International Workshop on Approximation and Online Algorithms, Springer LNCS 8952, pp. 23–34 (2014)

  15. Cheng, T.C.E., Kellerer, H., Kotov, V.: Semi-on-line multiprocessor scheduling with given total processing time. Theor. Comput. Sci. 337, 134–146 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Deng, X., Kameda, T., Papadimitriou, C.H.: How to learn an unknown environment I: the rectilinear case. J. ACM 45, 215–245 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  17. Emek, Y., Fraigniaud, P., Korman, A., Rosén, A.: Online computation with advice. Theor. Comput. Sci. 2412(24), 2642–2656 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Englert, M., Özmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. SIAM J. Comput. 43(3), 1220–1237 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  19. Faigle, U., Kern, W., Turan, G.: On the performance of on-line algorithms for partition problems. Acta Cybern. 9, 107–119 (1989)

    MathSciNet  MATH  Google Scholar 

  20. Feller, W.: An Introduction to Probability Theory and its Applications. Wiley, New York (1968)

    MATH  Google Scholar 

  21. Fleischer, R., Wahl, M.: Online scheduling revisited. J. Sched. 3, 343–353 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  22. Fraigniaud, P., Gasieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks 48, 166–177 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  23. Gabay, M., Kotov, V., Brauner, N.: Semi-online bin stretching with bunch tech- niques. HAL preprint hal-00869858 (2013)

  24. Galambos, G., Woeginger, G.: An on-line scheduling heuristic with better worst case ratio than Graham’s list scheduling. SIAM J. Comput. 22, 349–355 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  25. Graham, R.L.: Bounds for certain multi-processing anomalies. Bell Syst. Tech. J. 45, 1563–1581 (1966)

    Article  MATH  Google Scholar 

  26. Gormley, T., Reingold, N., Torng, E., Westbrook, J.: Generating adversaries for request-answer games. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 564–565 (2000)

  27. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144–162 (1987)

    Article  MathSciNet  Google Scholar 

  28. Irani, S.: Coloring inductive graphs on-line. Algorithmica 11, 53–72 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  29. Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. J. Algorithms 20, 400–430 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  30. Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 352–358 (1990)

  31. Kellerer, H., Kotov, V.: An efficient algorithm for bin stretching. Oper. Res. Lett. 41(4), 343–346 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  32. Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21, 235–242 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  33. López-Ortiz, A., Schuierer, S.: On-line parallel heuristics, processor scheduling and robot searching under the competitive framework. Theor. Comput. Sci. 310, 527–537 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  34. Lovász, L., Saks, M.E., Trotter, W.A.: An on-line graph coloring algorithm with sublinear performance ratio. Discrete Math. 75, 319–325 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  35. Raghavan, P., Snir, M.: Memory versus randomization in on-line algorithms. IBM J. Res. Dev. 38, 683–708 (1994)

    Article  Google Scholar 

  36. Renault, M.P., Rosén, A., van Stee, R.: Online Algorithms with advice for bin packing and scheduling problems. Theor. Comput. Sci. 600, 155–170 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  37. Rudin III, J.F.: Improved bounds for the on-line scheduling problem. Ph.D. Thesis, The University of Texas at Dallas, May (2001)

  38. Rudin III, J.F., Chandrasekaran, R.: Improved bounds for the online scheduling problem. SIAM J. Comput. 32, 717–735 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  39. Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Math. Oper. Res. 34(2), 481–498 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  40. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202–208 (1985)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

We thank two anonymous referees for helpful comments improving the presentation of this paper.

Author information

Authors and Affiliations

  1. Department of Computer Science, Technische Universität München, Boltzmannstr. 3, 85748, Garching, Germany

    Susanne Albers

  2. Department of Computer Science, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Matthias Hellwig

Authors
  1. Susanne Albers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Hellwig
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Susanne Albers.

Additional information

A preliminary version of this paper has appeared in Proc. 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2014.

S. Albers: Work supported by the German Research Foundation, project Al 464/7-1.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Albers, S., Hellwig, M. Online Makespan Minimization with Parallel Schedules. Algorithmica 78, 492–520 (2017). https://doi.org/10.1007/s00453-016-0172-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-016-0172-5

Keywords

Search

Navigation