Lower bounds for batched bin packing

János Balogh; József Békési; György Dósa; Leah Epstein; Asaf Levin

doi:10.1007/s10878-021-00797-z

Lower bounds for batched bin packing

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

Department of Mathematics

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

Abstract

We consider batched bin packing. Items are presented in a constant number of batches, and each batch should be packed before the next batch is presented. The cases of two, three, and four batches are studied. We prove improved lower bounds for the standard and parametric variants in some of the cases, and shorten the proofs for all other cases. To achieve this, we apply a new technique in our analysis, which differs from the ones previously used for proving such results.

Original language	English
Pages (from-to)	613-629
Number of pages	17
Journal	Journal of Combinatorial Optimization
Volume	43
Issue number	3
DOIs	https://doi.org/10.1007/s10878-021-00797-z
State	Published - 2021

Bibliographical note

Funding Information:
J. Balogh was supported by the project “Extending the activities of the HU-MATHS-IN Hungarian Industrial and Innovation Mathematical Service Network” EFOP-3.6.2-16-2017-00015, and by the project “Integrated program for training new generation of scientists in the fields of computer science”, EFOP-3.6.3-VEKOP-16-2017-00002. The project has been supported by the European Union and co-funded by the European Social Fund. J. Békési was supported by the EU-funded Hungarian grant “Integrated program for training new generation of scientists in the fields of computer science” EFOP-3.6.3-VEKOP-16-2017-0002, and by National Research, Development and Innovation Office NKFIH under the Grant SNN 129178. Gy. Dósa was supported by National Research, Development and Innovation Office–NKFIH under the Grant SNN 129364 and by Széchenyi 2020 under the EFOP-3.6.1-16-2016-00015. A. Levin was partially supported by Grant Number 308/18 of ISF - Israeli Science Foundation.

Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

Keywords

Batched problems
Bin packing
Competitive analysis
Online algorithms

ASJC Scopus subject areas

Computer Science Applications
Discrete Mathematics and Combinatorics
Control and Optimization
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1007/s10878-021-00797-z

Cite this

@article{ee0da61ef3964adabb786bff480dfaa7,

title = "Lower bounds for batched bin packing",

abstract = "We consider batched bin packing. Items are presented in a constant number of batches, and each batch should be packed before the next batch is presented. The cases of two, three, and four batches are studied. We prove improved lower bounds for the standard and parametric variants in some of the cases, and shorten the proofs for all other cases. To achieve this, we apply a new technique in our analysis, which differs from the ones previously used for proving such results.",

keywords = "Batched problems, Bin packing, Competitive analysis, Online algorithms",

author = "J{\'a}nos Balogh and J{\'o}zsef B{\'e}k{\'e}si and Gy{\"o}rgy D{\'o}sa and Leah Epstein and Asaf Levin",

note = "Funding Information: J. Balogh was supported by the project “Extending the activities of the HU-MATHS-IN Hungarian Industrial and Innovation Mathematical Service Network” EFOP-3.6.2-16-2017-00015, and by the project “Integrated program for training new generation of scientists in the fields of computer science”, EFOP-3.6.3-VEKOP-16-2017-00002. The project has been supported by the European Union and co-funded by the European Social Fund. J. B{\'e}k{\'e}si was supported by the EU-funded Hungarian grant “Integrated program for training new generation of scientists in the fields of computer science” EFOP-3.6.3-VEKOP-16-2017-0002, and by National Research, Development and Innovation Office NKFIH under the Grant SNN 129178. Gy. D{\'o}sa was supported by National Research, Development and Innovation Office–NKFIH under the Grant SNN 129364 and by Sz{\'e}chenyi 2020 under the EFOP-3.6.1-16-2016-00015. A. Levin was partially supported by Grant Number 308/18 of ISF - Israeli Science Foundation. Publisher Copyright: {\textcopyright} 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2021",

doi = "10.1007/s10878-021-00797-z",

language = "English",

volume = "43",

pages = "613--629",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Lower bounds for batched bin packing

AU - Balogh, János

AU - Békési, József

AU - Dósa, György

AU - Epstein, Leah

AU - Levin, Asaf

N1 - Funding Information: J. Balogh was supported by the project “Extending the activities of the HU-MATHS-IN Hungarian Industrial and Innovation Mathematical Service Network” EFOP-3.6.2-16-2017-00015, and by the project “Integrated program for training new generation of scientists in the fields of computer science”, EFOP-3.6.3-VEKOP-16-2017-00002. The project has been supported by the European Union and co-funded by the European Social Fund. J. Békési was supported by the EU-funded Hungarian grant “Integrated program for training new generation of scientists in the fields of computer science” EFOP-3.6.3-VEKOP-16-2017-0002, and by National Research, Development and Innovation Office NKFIH under the Grant SNN 129178. Gy. Dósa was supported by National Research, Development and Innovation Office–NKFIH under the Grant SNN 129364 and by Széchenyi 2020 under the EFOP-3.6.1-16-2016-00015. A. Levin was partially supported by Grant Number 308/18 of ISF - Israeli Science Foundation. Publisher Copyright: © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

PY - 2021

Y1 - 2021

N2 - We consider batched bin packing. Items are presented in a constant number of batches, and each batch should be packed before the next batch is presented. The cases of two, three, and four batches are studied. We prove improved lower bounds for the standard and parametric variants in some of the cases, and shorten the proofs for all other cases. To achieve this, we apply a new technique in our analysis, which differs from the ones previously used for proving such results.

AB - We consider batched bin packing. Items are presented in a constant number of batches, and each batch should be packed before the next batch is presented. The cases of two, three, and four batches are studied. We prove improved lower bounds for the standard and parametric variants in some of the cases, and shorten the proofs for all other cases. To achieve this, we apply a new technique in our analysis, which differs from the ones previously used for proving such results.

KW - Batched problems

KW - Bin packing

KW - Competitive analysis

KW - Online algorithms

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

U2 - 10.1007/s10878-021-00797-z

DO - 10.1007/s10878-021-00797-z

M3 - Article

AN - SCOPUS:85113789668

SN - 1382-6905

VL - 43

SP - 613

EP - 629

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 3

ER -

Lower bounds for batched bin packing

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this