크기가 다양한 bin-packing 문제에 대한 algorithm

In this paper, we consider variable sized bin packing problem, where the objective is not to minimize the total space used in the packing but to minimize the total cost of the packing when the cost of unit size of each bin does not increase as the bin size increases. A heuristic algorithm is described, and analyzed in two special cases: 1) b$\sub$m/｜…｜b$_1$and w$\sub$n/｜…｜w$_1$, and 2) b$\sub$m/｜…｜b$_1$, where b$\sub$i/ denotes the size of i-th type of bin and w$\sub$j/ denotes the size of j-th item. In the case 1), the algorithm guarantees optimality, and in the case 2), it guarantees asymptotic worst-case performance bounds of l1/9.