IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i2d10.1007_s10878-014-9749-6.html
   My bibliography  Save this article

Online bin packing with (1,1) and (2, $$R$$ R ) bins

Author

Listed:
  • Jing Chen

    (Kyoto University)

  • Xin Han

    (Dalian University of Technology)

  • Kazuo Iwama

    (Kyoto University)

  • Hing-Fung Ting

    (The University of Hong Kong)

Abstract

We study a variant of online bin packing problem, in which there are two types of bins: $$(1,1)$$ ( 1 , 1 ) and $$(2,R)$$ ( 2 , R ) , i.e., unit size bin with cost 1 and size 2 bin with cost $$R > 1$$ R > 1 , the objective is to minimize the total cost occurred when all the items are packed into the two types of bins. When $$R > 3$$ R > 3 , the offline version of this problem is equivalent to the classical bin packing problem. In this paper, we focus on the case $$ R \le 3$$ R ≤ 3 , and propose online algorithms and obtain lower bounds for the problem.

Suggested Citation

  • Jing Chen & Xin Han & Kazuo Iwama & Hing-Fung Ting, 2015. "Online bin packing with (1,1) and (2, $$R$$ R ) bins," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 276-298, August.
  • Handle: RePEc:spr:jcomop:v:30:y:2015:i:2:d:10.1007_s10878-014-9749-6
    DOI: 10.1007/s10878-014-9749-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9749-6
    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-014-9749-6?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. Yong Zhang & Francis Y. L. Chin & Hing-Fung Ting & Xin Han, 2013. "Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 223-236, August.
    2. János Balogh & József Békési & Gábor Galambos & Gerhard Reinelt, 2014. "On-line bin packing with restricted repacking," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 115-131, January.
    3. János Balogh & József Békési, 2013. "Semi-on-line bin packing: a short overview and a new lower bound," 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(4), pages 685-698, December.
    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. 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.
    2. 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.
    3. Paulina Grzegorek & Janusz Januszewski, 2019. "Drawer algorithms for 1-space bounded multidimensional hyperbox packing," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 1011-1044, April.
    4. Zhu, Dingju, 2016. "Quasi-human seniority-order algorithm for unequal circles packing," Chaos, Solitons & Fractals, Elsevier, vol. 89(C), pages 506-517.
    5. Tibor Csendes & Tibor Jordán & Tamás Szántai, 2013. "Editorial," 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(4), pages 663-664, December.

    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:30:y:2015:i:2:d:10.1007_s10878-014-9749-6. 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.