IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v2y2010i3p336-346.html
   My bibliography  Save this article

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

Author

Listed:
  • Massimiliano Caramia
  • Stefano Giordani

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.

Suggested Citation

  • Massimiliano Caramia & Stefano Giordani, 2010. "An asymptotic worst case analysis of the effectiveness of the Harmonic 3D-shelf algorithm for online 3D-strip packing," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 2(3), pages 336-346.
  • Handle: RePEc:ids:ijmore:v:2:y:2010:i:3:p:336-346
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=32722
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:2:y:2010:i:3:p:336-346. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.