A Stochastic Analysis of the NFD Bin-Packing Algorithm
暂无分享,去创建一个
Abstract We consider the Next-Fit-Decreasing (NFD) algorithm for the one-dimensional bin packing problem. The input consists of n pieces of i.i.d. sizes. Bounds on the first two moments of the number of bins used in the packing are established for arbitrary size distributions. These bounds are asymptotically tight. For the uniform distribution we also exhibit numerical results and examine their dependence on the support of the size distribution.
[1] N. Karmarkar. Probabilistic analysis of some bin-packing problems , 1982, FOCS 1982.
[2] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .
[3] D. T. Lee,et al. A simple on-line bin-packing algorithm , 1985, JACM.
[4] Micha Hofri,et al. A Stochastic Model of Bin-Packing , 1980, Inf. Control..
[5] Micha Hofri. A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm , 1984, J. Algorithms.