University of Leicester
Browse
stretch3bins.pdf (1.28 MB)

Online bin stretching with three bins

Download (1.28 MB)
journal contribution
posted on 2017-02-06, 16:50 authored by Martin Böhm, Jiri Sgall, Rob van Stee, Pavel Veselý
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 11/8 = 1.375 for three bins. Additionally, we present a lower bound of 45/33 = 1.36 for Online Bin Stretching on three bins and a lower bound of 19/14 for four and five bins that were discovered using a computer search.

History

Citation

Journal of Scheduling, 2017, pp. 1-21

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Version

  • AM (Accepted Manuscript)

Published in

Journal of Scheduling

Publisher

Springer Verlag

issn

1094-6136

eissn

1099-1425

Copyright date

2017

Available date

2018-01-11

Publisher version

http://link.springer.com/article/10.1007/s10951-016-0504-y

Notes

The file associated with this record is embargoed until 12 months after the date of publication. The final published version may be available through the links above. Following the embargo period the above license applies.

Language

en

Usage metrics

    University of Leicester Publications

    Categories

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC