NF-based algorithms for online bin packing with buffer and bounded item size
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-014-9771-8
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- 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.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- 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.
- 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.
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.- Zhu, Dingju, 2016. "Quasi-human seniority-order algorithm for unequal circles packing," Chaos, Solitons & Fractals, Elsevier, vol. 89(C), pages 506-517.
- 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.
- 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.
- 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).
- 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.
- 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.
- 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.
More about this item
Keywords
Bin packing; Online algorithm; Asymptotic competitive ratio;All these keywords.
Statistics
Access and download statisticsCorrections
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-9771-8. 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.