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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call