Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18031
Title: Bin-packing problem with concave costs of bin utilization
Authors: Li, CL 
Chen, ZL
Keywords: Bin packing
Concavity
Worst-case analysis
Issue Date: 2006
Publisher: John Wiley & Sons
Source: Naval research logistics, 2006, v. 53, no. 4, p. 298-308 How to cite?
Journal: Naval research logistics 
Abstract: We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied to our model. The absolute worst-case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics.
URI: http://hdl.handle.net/10397/18031
ISSN: 0894-069X
EISSN: 1520-6750
DOI: 10.1002/nav.20142
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

14
Last Week
0
Last month
0
Citations as of Sep 15, 2017

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
0
Citations as of Sep 8, 2017

Page view(s)

51
Last Week
0
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.