Lower bounds for batched bin packing

János Balogh (), József Békési (), György Dósa (), Leah Epstein () and Asaf Levin ()
Additional contact information
János Balogh: University of Szeged
József Békési: University of Szeged
György Dósa: University of Pannonia
Leah Epstein: University of Haifa
Asaf Levin: The Technion

Journal of Combinatorial Optimization, 2022, vol. 43, issue 3, No 6, 613-629

Abstract: 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: Bin packing; Batched problems; Competitive analysis; Online algorithms (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00797-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:43:y:2022:i:3:d:10.1007_s10878-021-00797-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00797-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().