FFD bin packing for item sizes with distributions on [0,1/2]

  • Authors:

  • Sally Floyd;Richard Karp

  • Affiliations:

  • -;-

  • Venue:
  • SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the expected behavior of the FFD binpacking 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 9.4 bins, independent of N. We extend this upper bound to a FFD bin-packing of items in accordance with a non-homogeneous Poisson process with a nonincreasing intensity function λ(t) on [0,1/2].