IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v24y2021i6d10.1007_s10951-021-00709-3.html
   My bibliography  Save this article

More on ordered open end bin packing

Author

Listed:
  • János Balogh

    (University of Szeged)

  • Leah Epstein

    (University of Haifa)

  • Asaf Levin

    (The Technion)

Abstract

We consider the Ordered Open End Bin Packing problem. Items of sizes in (0, 1] are presented one by one, to be assigned to bins in this order. An item can be assigned to any bin for which the current total size is strictly below 1. This means also that the bin can be overloaded by its last packed item. We improve lower and upper bounds on the asymptotic competitive ratio in the online case. Specifically, we design the first algorithm whose asymptotic competitive ratio is strictly below 2, and its value is close to the lower bound. This is in contrast to the best possible absolute competitive ratio, which is equal to 2. We also study the offline problem where the sequence of items is known in advance, while items are still assigned to bins based on their order in the sequence. For this scenario, we design an asymptotic polynomial time approximation scheme.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jsched:v:24:y:2021:i:6:d:10.1007_s10951-021-00709-3
    DOI: 10.1007/s10951-021-00709-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-021-00709-3
    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/s10951-021-00709-3?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. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    2. Leah Epstein, 2009. "On online bin packing with LIB constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(8), pages 780-786, December.
    3. Leah Epstein, 2019. "A lower bound for online rectangle packing," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 846-866, October.
    4. Gyorgy Dosa & Zsolt Tuza & Deshi Ye, 2013. "Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 416-436, October.
    5. Jian Yang & Joseph Y.-T. Leung, 2003. "The Ordered Open-End Bin-Packing Problem," Operations Research, INFORMS, vol. 51(5), pages 759-770, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Epstein, Leah, 2024. "Tighter bounds for the harmonic bin packing algorithm," European Journal of Operational Research, Elsevier, vol. 316(1), pages 72-84.

    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. K. Aardal & R. E. Bixby & C. A. J. Hurkens & A. K. Lenstra & J. W. Smeltink, 2000. "Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 192-202, August.
    2. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    3. Friedrich Eisenbrand & Gennady Shmonin, 2008. "Parametric Integer Programming in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 839-850, November.
    4. Masing, Berenike & Lindner, Niels & Borndörfer, Ralf, 2022. "The price of symmetric line plans in the Parametric City," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 419-443.
    5. Danny Nguyen & Igor Pak, 2020. "The Computational Complexity of Integer Programming with Alternations," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 191-204, February.
    6. Sascha Kurz & Nikolas Tautenhahn, 2013. "On Dedekind’s problem for complete simple games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 411-437, May.
    7. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    8. Herbert E. Scarf & David F. Shallcross, 2008. "The Frobenius Problem and Maximal Lattice Free Bodies," Palgrave Macmillan Books, in: Zaifu Yang (ed.), Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research, chapter 7, pages 149-153, Palgrave Macmillan.
    9. Elhedhli, Samir & Naoum-Sawaya, Joe, 2015. "Improved branching disjunctions for branch-and-bound: An analytic center approach," European Journal of Operational Research, Elsevier, vol. 247(1), pages 37-45.
    10. 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.
    11. Mauro Dell’Amico & Simone Falavigna & Manuel Iori, 2015. "Optimization of a Real-World Auto-Carrier Transportation Problem," Transportation Science, INFORMS, vol. 49(2), pages 402-419, May.
    12. Karen Aardal & Cor A. J. Hurkens & Arjen K. Lenstra, 2000. "Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 427-442, August.
    13. Ariel D Procaccia & Michal Feldmany & Jeffrey S Rosenschein, 2007. "Approximability and Inapproximability of Dodgson and Young Elections," Levine's Bibliography 122247000000001616, UCLA Department of Economics.
    14. Klabjan, Diego, 2007. "Subadditive approaches in integer programming," European Journal of Operational Research, Elsevier, vol. 183(2), pages 525-545, December.
    15. Alexander Bockmayr & Friedrich Eisenbrand, 2001. "Cutting Planes and the Elementary Closure in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 304-312, May.
    16. Gérard Cornuéjols & Milind Dawande, 1999. "A Class of Hard Small 0-1 Programs," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 205-210, May.
    17. Li, Weidong & Ou, Jinwen, 2024. "Machine scheduling with restricted rejection: An Application to task offloading in cloud–edge collaborative computing," European Journal of Operational Research, Elsevier, vol. 314(3), pages 912-919.
    18. Perboli, Guido & Brotcorne, Luce & Bruni, Maria Elena & Rosano, Mariangela, 2021. "A new model for Last-Mile Delivery and Satellite Depots management: The impact of the on-demand economy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    19. Xueling Zhong & Jinwen Ou, 2017. "Improved approximation algorithms for parallel machine scheduling with release dates and job rejection," 4OR, Springer, vol. 15(4), pages 387-406, December.
    20. Zhu, Dingju, 2016. "Quasi-human seniority-order algorithm for unequal circles packing," Chaos, Solitons & Fractals, Elsevier, vol. 89(C), pages 506-517.

    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:jsched:v:24:y:2021:i:6:d:10.1007_s10951-021-00709-3. 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.