IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v217y2014i1p55-7610.1007-s10479-014-1572-z.html
   My bibliography  Save this article

Relations between capacity utilization, minimal bin size and bin number

Author

Listed:
  • Torsten Buchwald
  • Kirsten Hoffmann
  • Guntram Scheithauer

Abstract

We consider the two-dimensional bin packing problem given a set of rectangular items, find the minimal number of rectangular bins needed to pack all items. Rotation of the items is not permitted. We show for any integer $${k} \ge 3$$ k ≥ 3 that at most $${k}-1$$ k - 1 bins are needed to pack all items if every item fits into a bin and if the total area of items does not exceed $${k}/4$$ k / 4 -times the bin area. Moreover, this bound is tight. Furthermore, we show that only two bins are necessary to pack all items if the total area of items is not larger than the bin area, and if the height of each item is not larger than a third of the bin height and the width of every item does not exceed half of the bin width. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Torsten Buchwald & Kirsten Hoffmann & Guntram Scheithauer, 2014. "Relations between capacity utilization, minimal bin size and bin number," Annals of Operations Research, Springer, vol. 217(1), pages 55-76, June.
    • Handle: RePEc:spr:annopr:v:217:y:2014:i:1:p:55-76:10.1007/s10479-014-1572-z
    DOI: 10.1007/s10479-014-1572-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-014-1572-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-014-1572-z?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. Silvano Martello & Daniele Vigo, 1998. "Exact Solution of the Two-Dimensional Finite Bin Packing Problem," Management Science, INFORMS, vol. 44(3), pages 388-399, March.
    2. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    3. Sándor P. Fekete & Jörg Schepers, 2004. "A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 60(2), pages 311-329, October.
    Full references (including those not matched with items on IDEAS)

    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. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    2. Liao, Chung-Shou & Hsu, Chia-Hong, 2013. "New lower bounds for the three-dimensional orthogonal bin packing problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 244-252.
    3. Khanafer, Ali & Clautiaux, François & Talbi, El-Ghazali, 2010. "New lower bounds for bin packing problems with conflicts," European Journal of Operational Research, Elsevier, vol. 206(2), pages 281-288, October.
    4. Clautiaux, Francois & Carlier, Jacques & Moukrim, Aziz, 2007. "A new exact method for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1196-1211, December.
    5. 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.
    6. Polyakovsky, Sergey & M'Hallah, Rym, 2009. "An agent-based approach to the two-dimensional guillotine bin packing problem," European Journal of Operational Research, Elsevier, vol. 192(3), pages 767-781, February.
    7. Wei, Lijun & Oon, Wee-Chong & Zhu, Wenbin & Lim, Andrew, 2011. "A skyline heuristic for the 2D rectangular packing and strip packing problems," European Journal of Operational Research, Elsevier, vol. 215(2), pages 337-346, December.
    8. Michele Monaci & Paolo Toth, 2006. "A Set-Covering-Based Heuristic Approach for Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 71-85, February.
    9. Krzysztof Fleszar, 2016. "An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 703-720, November.
    10. Braam, Florian & van den Berg, Daan, 2022. "Which rectangle sets have perfect packings?," Operations Research Perspectives, Elsevier, vol. 9(C).
    11. Önder Aşık & Ender Özcan, 2009. "Bidirectional best-fit heuristic for orthogonal rectangular strip packing," Annals of Operations Research, Springer, vol. 172(1), pages 405-427, November.
    12. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    13. Fernando Aliaga & Diego Delle Donne & Guillermo Durán & Javier Marenco, 2022. "Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques," Annals of Operations Research, Springer, vol. 316(2), pages 891-904, September.
    14. Qi Zhang & Shixin Liu & Ruiyou Zhang & Shujin Qin, 2021. "Column generation algorithms for mother plate design in steel plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 127-153, March.
    15. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    16. Kartak, Vadim M. & Ripatti, Artem V., 2018. "The minimum raster set problem and its application to the d-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 33-39.
    17. Stéphane Grandcolas & Cyril Pain-Barre, 2022. "A hybrid metaheuristic for the two-dimensional strip packing problem," Annals of Operations Research, Springer, vol. 309(1), pages 79-102, February.
    18. Selma Khebbache-Hadji & Christian Prins & Alice Yalaoui & Mohamed Reghioui, 2013. "Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(2), pages 307-336, March.
    19. Nestor M Cid-Garcia & Yasmin A Rios-Solis, 2020. "Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem," PLOS ONE, Public Library of Science, vol. 15(4), pages 1-22, April.
    20. Nikolaus Furian & Siegfried Vössner, 2014. "A hybrid algorithm for constrained order packing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(1), pages 157-186, March.

    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:spr:annopr:v:217:y:2014:i:1:p:55-76:10.1007/s10479-014-1572-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.