Please use this identifier to cite or link to this item:
Title: Online bin stretching with three bins
Authors: Böhm, Martin
Sgall, Jiri
van Stee, Rob
Veselý, Pavel
First Published: 11-Jan-2017
Publisher: Springer Verlag
Citation: Journal of Scheduling, 2017, pp. 1-21
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 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.
DOI Link: 10.1007/s10951-016-0504-y
ISSN: 1094-6136
eISSN: 1099-1425
Version: Post-print
Status: Peer-reviewed
Type: Journal Article
Rights: Copyright © Springer Verlag, 2017. This article is distributed under the terms of the Creative Commons Attribution-Non Commercial-No Derivatives License ( ), which permits use and distribution in any medium, provided the original work is properly cited, the use is non-commercial and no modifications or adaptations are made.
Description: 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.
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
stretch3bins.pdfPost-review (final submitted author manuscript)1.31 MBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.