IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i3d10.1007_s10878-017-0114-4.html
   My bibliography  Save this article

A two-phase algorithm for bin stretching with stretching factor 1.5

Author

Listed:
  • Martin Böhm

    (Computer Science Institute of Charles University)

  • Jiří Sgall

    (Computer Science Institute of Charles University)

  • Rob Stee

    (University of Leicester)

  • Pavel Veselý

    (Computer Science Institute of Charles University)

Abstract

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin.We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We build on previous algorithms and use a two-phase approach. However, our analysis is technically more complicated and uses amortization over the bins with the help of two weight functions.

Suggested Citation

  • Martin Böhm & Jiří Sgall & Rob Stee & Pavel Veselý, 2017. "A two-phase algorithm for bin stretching with stretching factor 1.5," Journal of Combinatorial Optimization, Springer, vol. 34(3), pages 810-828, October.
    • Handle: RePEc:spr:jcomop:v:34:y:2017:i:3:d:10.1007_s10878-017-0114-4
    DOI: 10.1007/s10878-017-0114-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0114-4
    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-017-0114-4?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.

    Citations

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


    Cited by:

    1. Islam Akaria & Leah Epstein, 2023. "Bin stretching with migration on two hierarchical machines," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(1), pages 111-153, August.
    2. György Dósa & Armin Fügenschuh & Zhiyi Tan & Zsolt Tuza & Krzysztof Węsek, 2019. "Tight lower bounds for semi-online scheduling on two uniform machines with known optimum," 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(4), pages 1107-1130, 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:34:y:2017:i:3:d:10.1007_s10878-017-0114-4. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.