Online bin stretching with three bins

Martin Böhm (), Jiří Sgall (), Rob Stee () and Pavel Veselý ()
Additional contact information
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

Journal of Scheduling, 2017, vol. 20, issue 6, No 6, 621 pages

Abstract: 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$$ 11 / 8 = 1.375 for three bins. Additionally, we present a lower bound of $$45/33 = 1.\overline{36}$$ 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.

Keywords: Online algorithms; Semi-online algorithms; Semi-online scheduling; Bin stretching; Bin packing; Lower bounds for online algorithms; Game tree search (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-016-0504-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:20:y:2017:i:6:d:10.1007_s10951-016-0504-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-016-0504-y

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().