More on batched bin packing

Leah Epstein

doi:10.1016/j.orl.2016.02.006

More on batched bin packing

Leah Epstein

Department of Mathematics

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

Abstract

Bin packing is the problem of partitioning a set of items into subsets of total sizes at most 1. In batched bin packing, items are presented in k batches, such that the items of a batch are presented as a set, to be packed before the next batch. In the disjunctive model, an algorithm must use separate bins for the different batches. We analyze the asymptotic and absolute approximation ratios for this last model completely, and show tight bounds as a function of k.

Original language	English
Pages (from-to)	273-277
Number of pages	5
Journal	Operations Research Letters
Volume	44
Issue number	2
DOIs	https://doi.org/10.1016/j.orl.2016.02.006
State	Published - 1 Mar 2016

Bibliographical note

Publisher Copyright:
© 2016 Elsevier B.V. All rights reserved.

Keywords

Approximation ratio
Batched problems
Bin packing

ASJC Scopus subject areas

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

Access to Document

10.1016/j.orl.2016.02.006

Cite this

@article{21ea8b666eeb439c91cd241f82099b56,

title = "More on batched bin packing",

abstract = "Bin packing is the problem of partitioning a set of items into subsets of total sizes at most 1. In batched bin packing, items are presented in k batches, such that the items of a batch are presented as a set, to be packed before the next batch. In the disjunctive model, an algorithm must use separate bins for the different batches. We analyze the asymptotic and absolute approximation ratios for this last model completely, and show tight bounds as a function of k.",

keywords = "Approximation ratio, Batched problems, Bin packing",

author = "Leah Epstein",

year = "2016",

month = mar,

day = "1",

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

language = "English",

volume = "44",

pages = "273--277",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - More on batched bin packing

AU - Epstein, Leah

PY - 2016/3/1

Y1 - 2016/3/1

N2 - Bin packing is the problem of partitioning a set of items into subsets of total sizes at most 1. In batched bin packing, items are presented in k batches, such that the items of a batch are presented as a set, to be packed before the next batch. In the disjunctive model, an algorithm must use separate bins for the different batches. We analyze the asymptotic and absolute approximation ratios for this last model completely, and show tight bounds as a function of k.

AB - Bin packing is the problem of partitioning a set of items into subsets of total sizes at most 1. In batched bin packing, items are presented in k batches, such that the items of a batch are presented as a set, to be packed before the next batch. In the disjunctive model, an algorithm must use separate bins for the different batches. We analyze the asymptotic and absolute approximation ratios for this last model completely, and show tight bounds as a function of k.

KW - Approximation ratio

KW - Batched problems

KW - Bin packing

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

U2 - 10.1016/j.orl.2016.02.006

DO - 10.1016/j.orl.2016.02.006

M3 - Article

AN - SCOPUS:84959365154

SN - 0167-6377

VL - 44

SP - 273

EP - 277

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

More on batched bin packing

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this