FFD bin packing for item sizes with uniform distributions on \([0,\frac12]\). (Q2641215): Difference between revisions

We study the expected behavior of the FFD bin-packing algorithm applied to items whose sizes are distributed in accordance with a Poisson process with rate N on the interval [0,1/2] of item sizes. By viewing the algorithm as a succession of queueing processes we show that the expected wasted space for FFD bin-packing is bounded above by 11.3 bins, independent of N.