Skip to main content
SpringerLink
Log in

Improved Lower Bound for Online Strip Packing

(Extended Abstract)

  • Conference paper
Approximation and Online Algorithms (WAOA 2011)

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

Included in the following conference series:

Introduction

In the two-dimensional strip packing problem a number of rectangles have to be packed without rotation or overlap into a strip such that the height of the strip used is minimal. The width of the rectangles is bounded by 1 and the strip haswidth 1 and infinite height.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Brown, D.J., Baker, B.S., Katseff, H.P.: Lower bounds for online two-dimensional packing algorithms. Acta Informatica 18, 207–225 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hurink, J., Paulus, J.: Online scheduling of parallel jobs on two machines is 2-competitive. Operations Research Letters 36(1), 51–56 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hurink, J.L., Paulus, J.J.: Online Algorithm for Parallel Job Scheduling and Strip Packing. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 67–74. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Johannes, B.: Scheduling parallel jobs to minimize the makespan. Journal of Scheduling 9(5), 433–452 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kern, W., Paulus, J.: A tight analysis of Brown-Baker-Katseff sequences for online strip packing. Submitted (J. Combinatorial Opt.)

    Google Scholar 

  6. Ye, D., Han, X., Zhang, G.: A note on online strip packing. Journal of Combinatorial Opt. 17(4), 417–423 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik (MPII), Campus E1 4, 66123, Saarbrücken, Germany

    Rolf Harren

  2. Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Walter Kern

Authors
  1. Rolf Harren
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Kern
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, ON, Canada

    Roberto Solis-Oba

  2. Dipartimento di Informatica "Renato M. Capocelli", Università di Salerno, Via Ponte Don Melillo, 84081, Fisciano, SA, Italy

    Giuseppe Persiano

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harren, R., Kern, W. (2012). Improved Lower Bound for Online Strip Packing. In: Solis-Oba, R., Persiano, G. (eds) Approximation and Online Algorithms. WAOA 2011. Lecture Notes in Computer Science, vol 7164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29116-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29116-6_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29115-9

  • Online ISBN: 978-3-642-29116-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation