| Article ID: | iaor20073037 |
| Country: | United States |
| Volume: | 53 |
| Issue: | 4 |
| Start Page Number: | 298 |
| End Page Number: | 308 |
| Publication Date: | Jun 2006 |
| Journal: | Naval Research Logistics |
| Authors: | Li Chung-Lun, Chen Zhi-Long |
| Keywords: | packing |
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.