We study the asymptotic expected behavior of the FF (first-fit) bin packing algorithm for special stochastic input sequences. It is shown that FF(L)-OFF(L) = O(√n) if the items of L = (a1, a2, an) are the following: ai = b with probability 0.5, =1-b with probability 0.5.
- bin packing
- bin packing as a random walk
- probabilistic analysis
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics