Parametric Lower Bound for On-Line Bin-Packing

Abstract

In this note we give lower bounds for such a one-dimensional bin-packing problem, in which we can use only one-line rules to pack the elements, and the maximal size of the elements are bounded. Our lower bound contains, as a special case, the result given by Liang [Inform. Proc. Lett., 10 (1980), pp. 76–79].