An asymptotic worst case analysis of the effectiveness of the Harmonic 3D-shelf algorithm for online 3D-strip packing Online publication date: Sat, 17-Apr-2010
by Massimiliano Caramia, Stefano Giordani
International Journal of Mathematics in Operational Research (IJMOR), Vol. 2, No. 3, 2010
Abstract: It is well known that shelf algorithms are used to pack items into strips. Harmonic shelf algorithms represent a particular subclass of these algorithms with which an asymptotic worst case analysis has been conducted on two-dimensional (2D) strip packing. In this paper, we consider the 3D-strip packing problem and analyse the effectiveness of the Harmonic 3D-shelf algorithm in terms of the ratio between the wasted volume inside the used portion of the strip and the total size of the latter, and we show that this algorithm is capable to pack items so that the asymptotic worst case value of this ratio comes arbitrarily close to 3/4. The results come from an extension of the 2D case.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com