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

Leah Epstein; Asaf Levin

doi:10.1016/j.orl.2020.10.006

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

Leah Epstein, Asaf Levin

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	844-849
Number of pages	6
Journal	Operations Research Letters
Volume	48
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2020.10.006
State	Published - Nov 2020

Bibliographical note

Publisher Copyright:
© 2020 Elsevier B.V.

Keywords

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

Access to Document

10.1016/j.orl.2020.10.006

Cite this

@article{dcc17e06a6c54f2f81cdea1915b447b6,

title = "A note on a variant of the online open end bin packing problem",

abstract = "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.",

keywords = "Asymptotic competitive ratio, Bin packing, Competitive analysis, Worst-case analysis",

author = "Leah Epstein and Asaf Levin",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2020",

month = nov,

doi = "10.1016/j.orl.2020.10.006",

language = "English",

volume = "48",

pages = "844--849",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

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

AU - Epstein, Leah

AU - Levin, Asaf

PY - 2020/11

Y1 - 2020/11

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

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

KW - Asymptotic competitive ratio

KW - Bin packing

KW - Competitive analysis

KW - Worst-case analysis

UR - http://www.scopus.com/inward/record.url?scp=85095708438&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2020.10.006

DO - 10.1016/j.orl.2020.10.006

M3 - Article

AN - SCOPUS:85095708438

SN - 0167-6377

VL - 48

SP - 844

EP - 849

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

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

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this