Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)
- 2000.04a
- /
- Pages.205-206
- /
- 2000
크기가 다양한 bin-packing 문제에 대한 algorithm
Abstract
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
Keywords