IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v71y2020i8p1301-1305.html
   My bibliography  Save this article

Complexity and relaxation methods for minimising total average cycle stock subject to practical constraints

Author

Listed:
  • Young-Soo Myung
  • Ilkyeong Moon

Abstract

This paper considers the problem of minimising total average cycle stock that is subject to practical constraints, as first studied by Silver and Moon and later by Hsieh, and Billionnet. For the problem, reorder intervals of a population of items are restricted to a given set, and the total number of replenishments allowed per unit time is limited. Previous researchers proposed different mathematical programming formulations and relaxation methods without identifying the computational complexity of the problem. In this study, we investigate the computational complexity of the problem and analyse the proposed relaxation methods. We identify NP-hard and polynomial time solvable cases of the problem and compare three different relaxations in terms of the lower bounds provided by each relaxation method. We also show that the relaxation with the strongest bound can be solved using a linear time greedy algorithm instead of a general-purpose linear programming algorithm.

Suggested Citation

  • Young-Soo Myung & Ilkyeong Moon, 2020. "Complexity and relaxation methods for minimising total average cycle stock subject to practical constraints," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(8), pages 1301-1305, August.
    • Handle: RePEc:taf:tjorxx:v:71:y:2020:i:8:p:1301-1305
    DOI: 10.1080/01605682.2019.1609879
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1609879
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2019.1609879?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:71:y:2020:i:8:p:1301-1305. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.