Parametric Lower Bound for On-Line Bin-Packing

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...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on matrix analysis and applications 1986-07, Vol.7 (3), p.362
Main Author: Galambos, G
Format: Article
Language:English
Subjects:
Algorithms
Packing problem
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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].
ISSN:0895-4798
1095-7162
DOI:10.1137/0607041