A Stochastic Model of Bin-Packing

Recent research in combinatorial bin-packing models is extended to a stochastic model in which an arbitrary distribution of piece sizes is assumed. The asymptotic expected bin occupancy is obtained for a simple on-line algorithm. Convergence properties are also presented so that, for a given set of pieces, this measure can be related to the expected number of bins required relative to an optimization rule.