You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
Shoshana Anily, Julien Bramel and David Simchi-Levi
Vol. 42, No. 2 (Mar. - Apr., 1994), pp. 287-298
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/171672
Page Count: 12
Preview not available
We consider the famous bin packing problem where a set of items must be stored in bins of equal capacity. In the classical version, the objective is to minimize the number of bins used. Motivated by several optimization problems that occur in the context of the storage of items, we study a more general cost structure where the cost of a bin is a concave function of the number of items in the bin. The objective is to store the items in such a way that total cost is minimized. Such cost functions can greatly alter the way the items should be assigned to the bins. We show that some of the best heuristics developed for the classical bin packing problem can perform poorly under the general cost structure. On the other hand, the so-called next-fit increasing heuristic has an absolute worst-case bound of no more than 1.75 and an asymptotic worst-case bound of 1.691 for any concave and monotone cost function. Our analysis also provides a new worst-case bound for the well studied next-fit decreasing heuristic when the objective is to minimize the number of bins used.
Operations Research © 1994 INFORMS