Skip to main content
SpringerLink
Log in

Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications

  • Chapter
Efficient Approximation and Online Algorithms

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3484))

Abstract

In this paper we present a general technique to solve min-max and max-min resource sharing problems and show how to use it for two applications: scheduling jobs on unrelated machines, and strip packing.

Supported by EU Thematic Network APPOL I+II, Approximation and Online Algorithms, IST-1999-14084 and IST-2001-30012.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aigner, M., Ziegler, G.M.: Proofs from THE BOOK. Springer, Heidelberg (1999)

    Google Scholar 

  2. Amoura, A.K., Bampis, E., Kenyon, C., Manoussakis, Y.: Scheduling independent multiprocessor tasks. Algorithmica 32, 247–261 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baker, B., Coffman, E., Rivest, R.: Orthogonal packings in two dimensions. SIAM Journal on Computing 9, 846–855 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bienstock, D.: Potential function methods for approximately solving linear programming problems: theory and practice. Kluwer, Boston (2002)

    MATH  Google Scholar 

  5. Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling in Computer and Manufacturing Systems. Springer, Berlin (1996)

    Google Scholar 

  6. Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: complexity, algorithms and approximability. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 21–169. Kluwer, Dordrecht (1998)

    Google Scholar 

  7. Coffman, E., Garey, M., Johnson, D., Tarjan, R.: Performance bounds for level-oriented two dimensional packing algorithms. SIAM Journal on Computing 9, 808–826 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  8. Chen, G.I., Lai, T.H.: Scheduling independent jobs on hypercubes. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 273–280. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  9. de la Vega, W.F., Lueker, C.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1, 349–355 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  10. Drozdowski, M.: Scheduling multiprocessor tasks - an overview. European Journal on Operations Research 94, 215–230 (1996)

    Article  MATH  Google Scholar 

  11. Du, J., Leung, J.: Complexity of scheduling parallel task systems. SIAM Journal on Discrete Mathematics 2, 473–487 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fishkin, A.V., Jansen, K., Mastrolilli, M.: Grouping techniques for scheduling problems: simpler and faster. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 206–218. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Garey, M.R., Graham, R.L.: Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing 4, 187–200 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  14. Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings 38th Symposium on Foundations of Computer Science, FOCS 1998, pp. 300–309 (1998)

    Google Scholar 

  15. Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research 21, 321–340 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  16. Grigoriadis, M.D., Khachiyan, L.G., Porkolab, L., Villavicencio, J.: Approximate max-min resource sharing for structured concave optimization. SIAM Journal on Optimization 41, 1081–1091 (2001)

    Article  MathSciNet  Google Scholar 

  17. Hall, L.: Approximation algorithms for scheduling. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard problems. PWS Publishing Company, Boston (1995)

    Google Scholar 

  18. Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association for Computing Machinery 23, 317–327 (1976)

    MATH  MathSciNet  Google Scholar 

  19. Jansen, K., Porkolab, L.: Improved approximation schemes for scheduling unrelated parallel machines. Mathematics of Operations Research 26, 324–338 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. Jansen, K., Porkolab, L.: Linear-time approximation schemes for scheduling malleable parallel tasks. Algorithmica 32, 507–520 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. Jansen, K., Porkolab, L.: On preemptive resource constrained scheduling: polynomial-time approximation schemes. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 329–349. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  22. Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Proceedings 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, Foundations of information technology in the era of network and mobile computing, pp. 255–266. Kluwer Publisher, Dordrecht (2002)

    Google Scholar 

  23. Jansen, K.: Approximation algorithms for the general max-min resource sharing problem: faster and simpler. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 311–322. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  24. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings 23rd IEEE Symposium on Foundations of Computer Science, FOCS 1882, pp. 312–320 (1982)

    Google Scholar 

  25. Kenyon, C., Remila, E.: Approximate strip packing. Mathematics of Operations Research 25, 645–656 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  26. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Algorithms and Combinatorics 21 (2000)

    Google Scholar 

  27. Lawler, E.: Fast approximation algorithms for knapsack problems. Mathematics of Operations Research 4, 339–356 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  28. Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 24, 259–272 (1990)

    Article  MathSciNet  Google Scholar 

  29. Ludwig, W., Tiwari, P.: Scheduling malleable and nonmalleable parallel tasks. In: Proceedings 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 167–176 (1994)

    Google Scholar 

  30. Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20, 257–301 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  31. Schiermeyer, I.: Reverse-Fit: A 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 290–299. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  32. Steinberg, A.: A strip-packing algorithm with absolute performance bound two. SIAM Journal on Computing 26, 401–409 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  33. Turek, J., Wolf, J., Yu, P.: Approximate algorithms for scheduling parallelizable tasks. In: Proceedings 4th ACM Symposium on Parallel Algorithms and Architectures, pp. 323–332 (1992)

    Google Scholar 

  34. Villavicencio, J., Grigoriadis, M.D.: Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos, P., Hearn, D.W., Hager, W.W. (eds.) Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 450, pp. 471–485 (1997)

    Google Scholar 

  35. Villavicencio, J., Grigoriadis, M.D.: Approximate structured optimization by cyclic block coordinate descent. In: Fisher, H., et al. (eds.) Applied Mathematics and Parallel Computing, pp. 359–371. Physica Verlag (1996)

    Google Scholar 

  36. Young, N.E.: Randomized rounding without solving the linear program. In: Proceedings 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 170–178 (1995)

    Google Scholar 

  37. Zhu, Y., Ahuja, M.: On job scheduling on a hypercube. IEEE Transactions on Parallel Distributed Systems 4, 62–69 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Boulevard François Mitterand, 91025, Evry Cedex, France

    Evripidis Bampis

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  3. Brown University, 02918, Providence, RI, USA

    Claire Kenyon

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jansen, K. (2006). Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications. In: Bampis, E., Jansen, K., Kenyon, C. (eds) Efficient Approximation and Online Algorithms. Lecture Notes in Computer Science, vol 3484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671541_6

Download citation

  • DOI: https://doi.org/10.1007/11671541_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32212-2

  • Online ISBN: 978-3-540-32213-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation