Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithms and Complexity

CIAC 2017: Algorithms and Complexity pp 10–15Cite as

New Algorithmic Results for Bin Packing and Scheduling

  • Conference paper
  • First Online:

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

Abstract

In this paper we present an overview about new results for bin packing and related scheduling problems. During the last years we have worked on the design of efficient exact and approximation algorithms for packing and scheduling problems. In order to obtain faster algorithms we studied integer linear programming (ILP) formulations for these problems and proved structural results for optimum solutions of the corresponding ILPs.

Research supported by the Deutsche Forschungsgemeinschaft (DFG), Project Ja 612/14-2, Entwicklung und Analyse von effizienten polynomiellen Approximationsschemata für Scheduling- und verwandte Optimierungsprobleme.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling. In: 8th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 493–500 (1997)

    Google Scholar 

  2. Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1, 55–66 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, L., Jansen, K., Zhang, G.: On the optimality of approximation schemes for the classical scheduling problem. In: 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 657–668 (2014)

    Google Scholar 

  4. Eisenbrand, F., Shmonin, G.: Carathéodory bounds for integer cones. Oper. Res. Lett. 34, 564–568 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39, 43–57 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Goemans, M.X., Rothvoß, T.: Polynomiality for bin packing with a constant number of item types. In: 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 830–839 (2014)

    Google Scholar 

  7. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563–1581 (1966)

    Article  MATH  Google Scholar 

  8. Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416–429 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hayes, A.C., Larman, D.G.: The vertices of the knapsack polytope. Discret. Appl. Math. 6(2), 135–138 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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 

  11. Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J. Comput. 17, 539–551 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1997)

    MATH  Google Scholar 

  13. Jansen, K.: An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables. SIAM J. Discret. Math. 24, 457–485 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Jansen, K., Klein, K.M., Verschae, J.: Closing the gap for makespan scheduling via sparsification techniques. In: 43rd International Colloquium on Automata, Languages, Programming, (ICALP), pp. 72:1–72:13 (2016). arXiv:1604.07153

  15. Jansen, K., Klein, K.M.: About the structure of the integer cone, its application to bin packing. In: 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1571–1581 (2017). arXiv:1604.07286

  16. Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538–548 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Leung, J.Y.-T.: Bin packing with restricted piece sizes. Inf. Process. Lett. 31, 145–149 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kannan, R.: Minkowski’s convex body theorem and integer programming. Math. Oper. Res. 12, 415–440 (1987)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 24098, Kiel, Germany

    Klaus Jansen

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Klaus Jansen .

Editor information

Editors and Affiliations

  1. National Technical University of Athens, Zografou, Athens, Greece

    Dimitris Fotakis

  2. National Technical University of Athens, Zografou, Athens, Greece

    Aris Pagourtzis

  3. Université Paris-Dauphine, Paris, France

    Vangelis Th. Paschos

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Jansen, K. (2017). New Algorithmic Results for Bin Packing and Scheduling. In: Fotakis, D., Pagourtzis, A., Paschos, V. (eds) Algorithms and Complexity. CIAC 2017. Lecture Notes in Computer Science(), vol 10236. Springer, Cham. https://doi.org/10.1007/978-3-319-57586-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57586-5_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57585-8

  • Online ISBN: 978-3-319-57586-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation