A Simple On-Line Bin-Packing Algorithm

C. C. Lee*, D. T. Lee

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

252 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)562-572
Number of pages11
JournalJournal of the ACM (JACM)
Volume32
Issue number3
DOIs
StatePublished - Jul 1 1985

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Information Systems
  • Hardware and Architecture
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A Simple On-Line Bin-Packing Algorithm'. Together they form a unique fingerprint.

Cite this