NF-based algorithms for online bin packing with buffer and bounded item size

Feifeng Zheng (), Li Luo () and E. Zhang ()
Additional contact information
Feifeng Zheng: Donghua University
Li Luo: Business School of Sichuan University
E. Zhang: Shanghai University of Finance and Economics

Journal of Combinatorial Optimization, 2015, vol. 30, issue 2, No 10, 360-369

Abstract: Abstract This paper studies a variation of online bin packing where there is a capacitated buffer to temporarily store items during packing, and item size is bounded within $$(\alpha , 1/2]$$ ( α , 1 / 2 ] for some $$0\le \alpha

Keywords: Bin packing; Online algorithm; Asymptotic competitive ratio (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9771-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:2:d:10.1007_s10878-014-9771-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9771-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().