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

Batched bin packing revisited

Author

Listed:
  • Gyorgy Dosa

    (University of Pannonia)

Abstract

We revisit the batched bin packing problem. In this model, items come in K consecutive batches, and the items of the earlier batches must be packed without any knowledge of later batches. We give the first approximation algorithm for the case $$K=2$$ K = 2 , with tight asymptotic approximation ratio of 1.5833, while the known lower bound of the model is 1.378. With the application of this result, we are also able to provide an improved algorithm for the recently defined graph-bin packing problem in a special case, where we improve the upper bound from 3 to 2.5833.

Suggested Citation

  • Gyorgy Dosa, 2017. "Batched bin packing revisited," Journal of Scheduling, Springer, vol. 20(2), pages 199-209, April.
    • Handle: RePEc:spr:jsched:v:20:y:2017:i:2:d:10.1007_s10951-015-0431-3
    DOI: 10.1007/s10951-015-0431-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-015-0431-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-015-0431-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. Klaus Jansen, 1999. "An Approximation Scheme for Bin Packing with Conflicts," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 363-377, December.
    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. Fleszar, Krzysztof, 2022. "A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation," European Journal of Operational Research, Elsevier, vol. 303(1), pages 37-53.
    2. Ananya Christman & Christine Chung & Nicholas Jaczko & Scott Westvold & David S. Yuen, 2022. "Robustly assigning unstable items," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1556-1577, October.
    3. Ulrich Pferschy & Joachim Schauer, 2013. "The maximum flow problem with disjunctive constraints," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 109-119, July.
    4. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    5. Renatha Capua & Yuri Frota & Luiz Satoru Ochi & Thibaut Vidal, 2018. "A study on exponential-size neighborhoods for the bin packing problem with conflicts," Journal of Heuristics, Springer, vol. 24(4), pages 667-695, August.
    6. Ananya Christman & Christine Chung & Nicholas Jaczko & Scott Westvold & David S. Yuen, 0. "Robustly assigning unstable items," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.
    7. 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.
    8. Borja Ena & Alberto Gomez & Borja Ponte & Paolo Priore & Diego Diaz, 2022. "Homogeneous grouping of non-prime steel products for online auctions: a case study," Annals of Operations Research, Springer, vol. 315(1), pages 591-621, August.
    9. Walaa H. El-Ashmawi & Ahmad Salah & Mahmoud Bekhit & Guoqing Xiao & Khalil Al Ruqeishi & Ahmed Fathalla, 2023. "An Adaptive Jellyfish Search Algorithm for Packing Items with Conflict," Mathematics, MDPI, vol. 11(14), pages 1-28, July.
    10. Samir Elhedhli & Lingzi Li & Mariem Gzara & Joe Naoum-Sawaya, 2011. "A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 404-415, August.
    11. Jasmin Grabenschweiger & Karl F. Doerner & Richard F. Hartl & Martin W. P. Savelsbergh, 2021. "The vehicle routing problem with heterogeneous locker boxes," 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. 29(1), pages 113-142, March.
    12. Albert E. Fernandes Muritiba & Manuel Iori & Enrico Malaguti & Paolo Toth, 2010. "Algorithms for the Bin Packing Problem with Conflicts," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 401-415, August.
    13. Wei, Zequn & Hao, Jin-Kao & Ren, Jintong & Glover, Fred, 2023. "Responsive strategic oscillation for solving the disjunctively constrained knapsack problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 993-1009.
    14. Sergio García & Valentina Cacchiani & Lieselot Vanhaverbeke & Martin Bischoff, 2014. "The table placement problem: a research challenge at the EWI 2007," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 208-226, April.
    15. Ruslan Sadykov & François Vanderbeck, 2013. "Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 244-255, May.
    16. Ekici, Ali, 2023. "A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1007-1020.

    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:20:y:2017:i:2:d:10.1007_s10951-015-0431-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.