IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v250y2016i3p754-759.html
   My bibliography  Save this article

A new lower bound for online strip packing

Author

Listed:
  • Yu, Guosong
  • Mao, Yanling
  • Xiao, Jiaoliao

Abstract

In this paper, we consider the online strip packing problem, in which a list of online rectangles has to be packed without overlap or rotation into a strip of width 1 and infinite length so as to minimize the required height of the packing. We derive a new improved lower bound of (3+5)/2≈2.618 for the competitive ratio for this problem. This result improves the best known lower bound of 2.589.

Suggested Citation

  • Yu, Guosong & Mao, Yanling & Xiao, Jiaoliao, 2016. "A new lower bound for online strip packing," European Journal of Operational Research, Elsevier, vol. 250(3), pages 754-759.
    • Handle: RePEc:eee:ejores:v:250:y:2016:i:3:p:754-759
    DOI: 10.1016/j.ejor.2015.10.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715009194
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.10.012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. W. Kern & J. J. Paulus, 2013. "A tight analysis of Brown-Baker-Katseff sequences for online strip packing," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 333-344, August.
    2. Deshi Ye & Xin Han & Guochuan Zhang, 2009. "A note on online strip packing," Journal of Combinatorial Optimization, Springer, vol. 17(4), pages 417-423, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    2. Deshi Ye & Danny Z. Chen & Guochuan Zhang, 2018. "Online scheduling of moldable parallel tasks," Journal of Scheduling, Springer, vol. 21(6), pages 647-654, December.
    3. Guosong Yu & Yanling Mao & Jiaoliao Xiao, 2017. "A new upper bound for the online square packing problem in a strip," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1411-1420, May.
    4. Kaiyuan Liu & Hongyu Zhang & Chong Wang & Hui Li & Yongquan Chen & Qiong Chen, 2023. "Robust Optimization for the Two-Dimensional Strip-Packing Problem with Variable-Sized Bins," Mathematics, MDPI, vol. 11(23), pages 1-22, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guosong Yu & Yanling Mao & Jiaoliao Xiao, 2017. "A new upper bound for the online square packing problem in a strip," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1411-1420, May.
    2. W. Kern & J. J. Paulus, 2013. "A tight analysis of Brown-Baker-Katseff sequences for online strip packing," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 333-344, August.
    3. Deshi Ye & Danny Z. Chen & Guochuan Zhang, 2018. "Online scheduling of moldable parallel tasks," Journal of Scheduling, Springer, vol. 21(6), pages 647-654, December.
    4. Guo, Shouwei & Kang, Liying, 2010. "Online scheduling of malleable parallel jobs with setup times on two identical machines," European Journal of Operational Research, Elsevier, vol. 206(3), pages 555-561, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:250:y:2016:i:3:p:754-759. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.