Stochastic online binpacking problem: exact conditions for bounded expected queue lengths under the best fit packing heuristic

Authors:
David Gamarnik
Affiliations:
T.J. Watson Research Center, IBM Yorktown Heights, NY
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2001

Citing 4
Cited 0

The average-case analysis of some on-line algorithms for bin packing

Combinatorica
Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Average-case analyses of first fit and random fit bin packing

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the following stochastic bin packing process: the items of different sizes arrive at times t = 0, 1, 2, … and are packed into unit size bins using "largest first" rule. The unpacked items form queues. Coffman and Stolyar [3] introduced this system and posed the following question: under which conditions expected queue lengths are bounded (system is stable)? We provide exact computable conditions for stability of this system using Lyapunov function technique. The result holds for a very general class of distributions of the arrival processes.