IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v27y2019i2d10.1007_s10100-018-0574-3.html
   My bibliography  Save this article

Bin packing problem with scenarios

Author

Listed:
  • Attila Bódis

    (University of Szeged)

  • János Balogh

    (University of Szeged)

Abstract

Scheduling over scenarios is one of the latest approaches in modelling scheduling problems including uncertainty. However, to the best of our knowledge, scenarios have never been applied to the bin packing problem, so here we introduce the bin packing problem with scenarios. In this model, we have a list of items with sizes between 0 and 1, and each item is assigned to one or more scenarios. In reality, the items of only one scenario will occur, but this chosen scenario is unknown at the time of packing, so the algorithms have to examine all scenarios. This means that the items have to be packed into bins such that for any scenario, the total size of the items in this scenario is at most 1 in each bin. The objective of the standard bin packing problem is to minimize the number of bins. Here, we introduce some extensions of the objective function to the scenario based model, and we present our competitive analysis of some online bin packing algorithms adapted to scenarios.

Suggested Citation

  • Attila Bódis & János Balogh, 2019. "Bin packing problem with scenarios," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 377-395, June.
    • Handle: RePEc:spr:cejnor:v:27:y:2019:i:2:d:10.1007_s10100-018-0574-3
    DOI: 10.1007/s10100-018-0574-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-018-0574-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/s10100-018-0574-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. Esteban Feuerstein & Alberto Marchetti-Spaccamela & Frans Schalekamp & René Sitters & Suzanne Ster & Leen Stougie & Anke Zuylen, 2017. "Minimizing worst-case and average-case makespan over scenarios," Journal of Scheduling, Springer, vol. 20(6), pages 545-555, December.
    2. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    3. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    4. Roman Rischke, 2014. "Two-Stage Robust Combinatorial Optimization with Priced Scenarios," Operations Research Proceedings, in: Dennis Huisman & Ilse Louwerse & Albert P.M. Wagelmans (ed.), Operations Research Proceedings 2013, edition 127, pages 377-382, Springer.
    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. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    2. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    3. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    4. M. J. Naderi & M. S. Pishvaee, 2017. "Robust bi-objective macroscopic municipal water supply network redesign and rehabilitation," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(9), pages 2689-2711, July.
    5. Zhang, Wei & (Ato) Xu, Wangtu, 2017. "Simulation-based robust optimization for the schedule of single-direction bus transit route: The design of experiment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 203-230.
    6. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 143-166, March.
    7. Rashed Khanjani-Shiraz & Ali Babapour-Azar & Zohreh Hosseini-Noudeh & Panos M. Pardalos, 2022. "Distributionally robust maximum probability shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 140-167, January.
    8. Hanks, Robert W. & Weir, Jeffery D. & Lunday, Brian J., 2017. "Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets," European Journal of Operational Research, Elsevier, vol. 262(2), pages 636-646.
    9. Roberto Gomes de Mattos & Fabricio Oliveira & Adriana Leiras & Abdon Baptista de Paula Filho & Paulo Gonçalves, 2019. "Robust optimization of the insecticide-treated bed nets procurement and distribution planning under uncertainty for malaria prevention and control," Annals of Operations Research, Springer, vol. 283(1), pages 1045-1078, December.
    10. Wang, Tian & Deng, Shiming, 2019. "Multi-Period energy procurement policies for smart-grid communities with deferrable demand and supplementary uncertain power supplies," Omega, Elsevier, vol. 89(C), pages 212-226.
    11. Fakhar, Majid & Mahyarinia, Mohammad Reza & Zafarani, Jafar, 2018. "On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization," European Journal of Operational Research, Elsevier, vol. 265(1), pages 39-48.
    12. Bastian, Nathaniel D. & Lunday, Brian J. & Fisher, Christopher B. & Hall, Andrew O., 2020. "Models and methods for workforce planning under uncertainty: Optimizing U.S. Army cyber branch readiness and manning," Omega, Elsevier, vol. 92(C).
    13. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2016. "The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty," Management Science, INFORMS, vol. 62(4), pages 1188-1201, April.
    14. Shaojian Qu & Yefan Han & Zhong Wu & Hassan Raza, 2021. "Consensus Modeling with Asymmetric Cost Based on Data-Driven Robust Optimization," Group Decision and Negotiation, Springer, vol. 30(6), pages 1395-1432, December.
    15. Donya Rahmani & Arash Zandi & Sara Behdad & Arezou Entezaminia, 2021. "A light robust model for aggregate production planning with consideration of environmental impacts of machines," Operational Research, Springer, vol. 21(1), pages 273-297, March.
    16. Roos, Ernst & den Hertog, Dick, 2019. "Reducing conservatism in robust optimization," Other publications TiSEM ad0238cd-de7a-4366-b487-b, Tilburg University, School of Economics and Management.
    17. Jonas Ide & Anita Schöbel, 2016. "Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 235-271, January.
    18. Jiankun Sun & Jan A. Van Mieghem, 2019. "Robust Dual Sourcing Inventory Management: Optimality of Capped Dual Index Policies and Smoothing," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 912-931, October.
    19. Gianfranco Guastaroba & Gautam Mitra & M Grazia Speranza, 2011. "Investigating the effectiveness of robust portfolio optimization techniques," Journal of Asset Management, Palgrave Macmillan, vol. 12(4), pages 260-280, September.
    20. Elisabeth Köbis, 2015. "On Robust Optimization," Journal of Optimization Theory and Applications, Springer, vol. 167(3), pages 969-984, 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:cejnor:v:27:y:2019:i:2:d:10.1007_s10100-018-0574-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.