Bin-packing problem with concave costs of bin utilization

Chung Lun Li, Zhi Long Chen

Research output: Journal article publicationJournal articleAcademic researchpeer-review

24 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)298-308
Number of pages11
JournalNaval Research Logistics
Issue number4
Publication statusPublished - 1 Jun 2006


  • Bin packing
  • Concavity
  • Worst-case analysis

ASJC Scopus subject areas

  • Modelling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research


Dive into the research topics of 'Bin-packing problem with concave costs of bin utilization'. Together they form a unique fingerprint.

Cite this