An asymptotic worst case analysis of the effectiveness of the harmonic 3D-shelf algorithm for online 3D-strip packing

DOI10.1504/IJMOR.2010.032722MaRDI QIDQ975802zbMATH OpenOpenAlexFDO

Authors Massimiliano Caramia, Stefano Giordani

Publication date 11 June 2010

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijmor.2010.032722

zbMATH Keywords

harmonic shelf algorithmsonline 3D strip packingonline algorithmsworst case analysis

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Review text

Summary: 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.

Recommendations

• On the effectiveness of the harmonic shelf algorithm for on-line strip packing
• Shelf algorithms for on-line strip packing
• Heuristic algorithms for on-line packing in three dimensions
• Approximate strip packing: revisited
• Harmonic algorithm for 3-dimensional strip packing problem

Cited in

(1)

• On the effectiveness of the harmonic shelf algorithm for on-line strip packing

This page was built for publication: An asymptotic worst case analysis of the effectiveness of the harmonic 3D-shelf algorithm for online 3D-strip packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975802)