IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i2d10.1007_s10878-015-9976-5.html
   My bibliography  Save this article

Online bin packing problem with buffer and bounded size revisited

Author

Listed:
  • Minghui Zhang

    (Dalian University of Technology
    Dalian Neusoft University of Information)

  • Xin Han

    (Dalian University of Technology)

  • Yan Lan

    (Dalian University of Technology
    Dalian Neusoft University of Information)

  • Hing-Fung Ting

    (University of Hong Kong)

Abstract

In this paper we study the online bin packing with buffer and bounded size, i.e., there are items with size within $$(\alpha ,1/2]$$ ( α , 1 / 2 ] where $$0 \le \alpha

Suggested Citation

  • Minghui Zhang & Xin Han & Yan Lan & Hing-Fung Ting, 2017. "Online bin packing problem with buffer and bounded size revisited," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 530-542, February.
    • Handle: RePEc:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9976-5
    DOI: 10.1007/s10878-015-9976-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9976-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9976-5?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. Kurt Eisemann, 1957. "The Trim Problem," Management Science, INFORMS, vol. 3(3), pages 279-284, April.
    2. Gyorgy Dosa & Zsolt Tuza & Deshi Ye, 2013. "Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 416-436, October.
    3. Feifeng Zheng & Li Luo & E. Zhang, 2015. "NF-based algorithms for online bin packing with buffer and bounded item size," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 360-369, August.
    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. József Békési & Gábor Galambos, 2018. "Tight bounds for NF-based bounded-space online bin packing algorithms," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 350-364, February.

    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. Klaus Jansen & Roberto Solis-Oba, 2011. "A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 743-753, November.
    2. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    3. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    4. József Békési & Gábor Galambos, 2018. "Tight bounds for NF-based bounded-space online bin packing algorithms," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 350-364, February.
    5. János Balogh & Leah Epstein & Asaf Levin, 2021. "More on ordered open end bin packing," Journal of Scheduling, Springer, vol. 24(6), pages 589-614, December.
    6. Sören Koch & Sebastian König & Gerhard Wäscher, 2008. "Linear Programming for a Cutting Problem in the Wood Processing Industry – A Case Study," FEMM Working Papers 08014, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    7. Perboli, Guido & Brotcorne, Luce & Bruni, Maria Elena & Rosano, Mariangela, 2021. "A new model for Last-Mile Delivery and Satellite Depots management: The impact of the on-demand economy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    8. Zhu, Dingju, 2016. "Quasi-human seniority-order algorithm for unequal circles packing," Chaos, Solitons & Fractals, Elsevier, vol. 89(C), pages 506-517.
    9. Ortmann, Frank G. & Ntene, Nthabiseng & van Vuuren, Jan H., 2010. "New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 306-315, June.
    10. Feifeng Zheng & Li Luo & E. Zhang, 2015. "NF-based algorithms for online bin packing with buffer and bounded item size," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 360-369, August.
    11. Maimon, Oded & Dayagi, Arie, 1995. "Nesting planning based on production priorities and technological efficiency," European Journal of Operational Research, Elsevier, vol. 80(1), pages 121-129, January.

    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:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9976-5. 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.