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

Jing Chen (), Xin Han (), Kazuo Iwama () and Hing-Fung Ting ()
Additional contact information
Jing Chen: Kyoto University
Xin Han: Dalian University of Technology
Kazuo Iwama: Kyoto University
Hing-Fung Ting: The University of Hong Kong

Journal of Combinatorial Optimization, 2015, vol. 30, issue 2, No 5, 276-298

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

Keywords: Bin packing; Competitive ratio; Linear programming (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9749-6 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-9749-6

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

DOI: 10.1007/s10878-014-9749-6

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