Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

Authors:
  • JFJ.B.G. Frenk
    J.B.G. Frenk
  • GGG. Galambos
    G. Galambos

Abstract
We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an new bin we have no possibility to pack elements into the earlier opened bins). We give a tight bound for its worst-case and show that this bound is a parameter of the maximal sizes of the items to be packed. Moreover, we also present a probabilistic analysis of this algorithm.
All Related Versions