IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v18y2013i2p201-217.html
   My bibliography  Save this article

A class of random algorithms for inventory cycle offsetting

Author

Listed:
  • Ernest Croot
  • Kai Huang

Abstract

The inventory cycle offsetting problem (ICP) is a strongly NP-complete problem. We study this problem from the view of probability theory, and rigorously analyse the performance of a specific random algorithm for this problem; furthermore, we present a 'local search' algorithm, and a 'modified local search' algorithm, which give much better results (the 'modified local search' gives better results than plain 'local search'), and lead to good solutions to certain practical instances of ICP, as we demonstrate with some numerical data. The regime where the random algorithm is rigorously proved to work is when the number of items is large, while the time horizon and unit volumes are not too large. Under such natural hypotheses, the law of large numbers, and various quantitative refinements (such as Bernstein's inequality) come into play, and we use these results to show that there always exist good solutions, not merely that good solutions holds with high probability.

Suggested Citation

  • Ernest Croot & Kai Huang, 2013. "A class of random algorithms for inventory cycle offsetting," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 18(2), pages 201-217.
    • Handle: RePEc:ids:ijores:v:18:y:2013:i:2:p:201-217
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=56115
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dorit S. Hochbaum & Xu Rao, 2019. "The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem," Operations Research, INFORMS, vol. 67(5), pages 1345-1361, September.

    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:ijores:v:18:y:2013:i:2:p:201-217. 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=170 .

    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.