Online bin packing problem with buffer and bounded size revisited

Minghui Zhang (), Xin Han (), Yan Lan () and Hing-Fung Ting ()
Additional contact information
Minghui Zhang: Dalian University of Technology
Xin Han: Dalian University of Technology
Yan Lan: Dalian University of Technology
Hing-Fung Ting: University of Hong Kong

Journal of Combinatorial Optimization, 2017, vol. 33, issue 2, No 9, 530-542

Abstract: 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

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

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9976-5 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:33:y:2017:i:2:d:10.1007_s10878-015-9976-5

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

DOI: 10.1007/s10878-015-9976-5

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 ().