Bin‐packing problem with concave costs of bin utilization
Chung‐Lun Li and
Zhi‐Long Chen
Naval Research Logistics (NRL), 2006, vol. 53, issue 4, 298-308
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. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
https://doi.org/10.1002/nav.20142
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:wly:navres:v:53:y:2006:i:4:p:298-308
Access Statistics for this article
More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().