Skip to main content
SpringerLink
Log in

Two-Dimensional On-Line Bin Packing Problem with Rotatable Items

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1858))

Included in the following conference series:

Abstract

In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is “rotatable” by 90 degrees. An on-line algorithm that uses an unbounded number of active bins is proposed. The worst case ratio of the algorithm is at least 2.25 and at most 2.565.

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. D. Blitz, A. van Vliet, and G. J. Woeginger. Lower bounds on the asymptotic worst-case ratio of on-line bin packing algorithms. unpublished manuscript, 1996.

    Google Scholar 

  2. D. Coppersmith and P. Raghavan. Multidimensional on-line bin packing: Algorithms and worst case analysis. Oper. Res. Lett., 8:17–20, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  3. J. Csirik and A. van Vliet. An on-line algorithm for multidimensional bin packing. Oper. Res. Lett., 13:149–158, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide for the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.

    Google Scholar 

  5. C. C. Lee and D. T. Lee. A simple on-line bin packing algorithm. J. Assoc. Comput. Mach., 32:562–572, 1985.

    MATH  MathSciNet  Google Scholar 

  6. M. B. Richey. Improved bounds for harmonic-based bin packing algorithms. Discrete Appl. Math., 34:203–227, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. van Vliet. An improved lower bound for on-line bin packing algorithms. Information Processing Letters, 43:277–284, 1992.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Hiroshima University, Higashi-Hiroshima, 739-8527, Japan

    Satoshi Fujita & Takeshi Hada

Authors
  1. Satoshi Fujita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takeshi Hada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, MN 55455, Minneapolis, USA

    Ding-Zhu Du

  2. Department of Computer Science and Software Engineering, University of Newcastle, Callaghan, NSW 2308, Australia

    Peter Eades  & Vladimir Estivill-Castro  & 

  3. School of Computer Science and Engineering, University of Newcastle, NSW 2052, Sydney, Australia

    Xuemin Lin  & Arun Sharma  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujita, S., Hada, T. (2000). Two-Dimensional On-Line Bin Packing Problem with Rotatable Items. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-44968-X_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67787-1

  • Online ISBN: 978-3-540-44968-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation