Some unexpected expected behavior results for bin packing

We study the asymptotic expected behavior of the First Fit and First Fit Decreasing bin packing algorithms applied to items chosen uniformly from the interval (0,u], u ≤ 1. Our results indicate that the algorithms perform even better than previously expected.

[1]  Micha Hofri,et al.  A Stochastic Model of Bin-Packing , 1980, Inf. Control..

[2]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3]  D. V. Lindley,et al.  An Introduction to Probability Theory and Its Applications. Volume II , 1967, The Mathematical Gazette.

[4]  David S. Johnson,et al.  An experimental study of bin packing , 1983 .

[5]  Donna J. Brown,et al.  A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms. , 1979 .

[6]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[7]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[8]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[9]  G. S. Lueker.  An average-case analysis of bin packing with uniformly distributed item sizes , 1982 .

[10]  B. Harshbarger.  An Introduction to Probability Theory and its Applications, Volume I , 1958 .

[11]  Michael J. Magazine,et al.  Probabilistic Analysis of Bin Packing Heuristics , 1984, Oper. Res..

[12]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[13]  George S. Lueker,et al.  Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[14]  Greg N. Frederickson,et al.  Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms , 1980, Inf. Process. Lett..

[15]  David S. Johnson,et al.  Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .

[16]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .