A note on online hypercube packing

A note on online hypercube packing

0.00 Avg rating0 Votes
Article ID: iaor20104742
Volume: 18
Issue: 2
Start Page Number: 221
End Page Number: 239
Publication Date: Jun 2010
Journal: Central European Journal of Operations Research
Authors: , ,
Keywords: bin packing
Abstract:

In this paper, we study an online multi-dimensional bin packing problem where all items are hypercubes. Hypercubes of different size arrive one by one, and we are asked to pack each of them without knowledge of the next pieces so that the number of bins used is minimized. Based on the techniques from one dimensional bin packing and specifically the algorithm Super Harmonic by Seiden (2002), we extend the framework for online bin packing problems developed by Seiden to the hypercube packing problem. To the best of our knowledge, this is the first paper to apply a version of Super Harmonic (and not of the Improved Harmonic algorithm) for online square packing, although the Super Harmonic has been already known before. Note that the best previous result was obtained by Epstein and van Stee (2005) using an instance of Improved Harmonic. In this paper we show that Super Harmonic is more powerful than Improve Harmonic for online hypercube packing, and then we obtain better upper bounds on asymptotic competitive ratios. More precisely, we get an upper bound of 2.1187 for square packing and an upper bound of 2.6161 for cube packing, which improve upon the previous upper bounds 2.24437 and 2.9421 for the two problems, respectively.

Reviews

Required fields are marked *. Your email address will not be published.