A simple on-line bin-packing algorithm

  • Authors:

  • C. C. Lee;D. T. Lee

  • Affiliations:

  • Northwestern Univ., Evanston, IL;Northwestern Univ., Evanston, IL

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1985

Quantified Score

Hi-index 0.01

Visualization

Abstract

The one-dimensional on-line bin-packing problem is considered, A simple O(1)-space and O(n)-time algorithm, called HARMONICM, is presented. It is shown that this algorithm can achieve a worst-case performance ratio of less than 1.692, which is better than that of the O(n)-space and O(n log n)-time algorithm FIRST FIT. Also shown is that 1.691 … is a lower bound for all 0(1)-space on-line bin-packing algorithms. Finally a revised version of HARMONICM , an O(n)-space and O(n)- time algorithm, is presented and is shown to have a worst-case performance ratio of less than 1.636.d