Online variable-sized bin packing (Q1111472)

The classical bin packing problem is one of the best-known and most widely studied problems of combinatorial optimization. Efficient offline approximation algorithms have recently been designed and analyzed for the more general and realistic model in which bins of differing capacities are allowed by \textit{D. K. Friesen} and \textit{M. A. Langston} [SIAM J. Comput. 15, 222-230 (1986; Zbl 0589.68036)]. In this paper, we consider fast online algorithms for this challenging model. Selecting either the smallest or the largest available bin size to begin a new bin as pieces arrive turns out to yield a tight worst-case ratio of 2. We devise a slightly more complicated scheme that uses the largest available bin size for small pieces, and selects bin sizes for large pieces based on a user- specified fill factor \(f\geq 1/2\), and prove that this strategy guarantees a worst-case bound not exceeding \(1.5+f/2\).