search query: @author Simchi-Levi, D. / total: 9
reference: 3 / 9
| Author: | Anily, S. Bramel, J. Simchi-Levi, D. |
| Title: | Worst-case analysis of heuristics for the bin packing problem with general cost structures. |
| Journal: | Operations Research
1994 : MAR-APR, VOL. 42:2, p. 287-298 |
| Index terms: | COSTS HEURISTIC METHODS PACKAGING INDUSTRY |
| Language: | eng |
| Abstract: | The authors 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. The authors 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 ways the items should be assigned to the bins. |
SCIMA