A note on a variant of the online open end bin packing problem

Leah Epstein, Asaf Levin

Research output: Contribution to journalArticlepeer-review


We study the minimum variant of the online open end bin packing problem. Items are presented one by one, and an item can be packed into a bin while the resulting total size of items excluding the minimum size item of the bin will be below 1. We design an improved online algorithm whose asymptotic competitive ratio does not exceed 1.180952381, and we prove a new lower bound of 1.1666666 on the asymptotic competitive ratio of any online algorithm.

Original languageEnglish
Pages (from-to)844-849
Number of pages6
JournalOperations Research Letters
Issue number6
StatePublished - Nov 2020

Bibliographical note

Publisher Copyright:
© 2020 Elsevier B.V.


  • Asymptotic competitive ratio
  • Bin packing
  • Competitive analysis
  • Worst-case analysis

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


Dive into the research topics of 'A note on a variant of the online open end bin packing problem'. Together they form a unique fingerprint.

Cite this