IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v43y2022i3d10.1007_s10878-021-00797-z.html
   My bibliography  Save this article

Lower bounds for batched bin packing

Author

Listed:
  • 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)

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.

Suggested Citation

  • János Balogh & József Békési & György Dósa & Leah Epstein & Asaf Levin, 2022. "Lower bounds for batched bin packing," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 613-629, April.
  • Handle: RePEc:spr:jcomop:v:43:y:2022:i:3:d:10.1007_s10878-021-00797-z
    DOI: 10.1007/s10878-021-00797-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00797-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-021-00797-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Leah Epstein, 2019. "A lower bound for online rectangle packing," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 846-866, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. János Balogh & Leah Epstein & Asaf Levin, 2021. "More on ordered open end bin packing," Journal of Scheduling, Springer, vol. 24(6), pages 589-614, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:43:y:2022:i:3:d:10.1007_s10878-021-00797-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.