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

Approximated closed-form minimum-cost solutions to the (S − 1, S) policy with complete backordering

Author

Listed:
  • Marcello Braglia
  • Davide Castellano
  • Marco Frosolini

Abstract

In this paper, we consider the continuous review (S − 1, S) policy with complete backordering, deterministic and constant lead-time, and with a Poissonian lead-time demand. Moreover, we take into account two different expressions of the total expected cost depending on the customer-service criterion adopted. First, we approximate the Poissonian lead-time demand with a well-suited Gaussian random variable. Although this system can be easily solved with a simple algorithmic approach, it is interesting to be aware of the direct analytical functional relationship between the optimal value of the decision variable and the parameters of the model. Hence, the second step consists in providing some approximated closed-form minimum-cost solutions for both cost models considered under a Gaussian lead-time demand. An extensive numerical study is finally shown to characterise the precision achieved by the approximations developed.

Suggested Citation

  • Marcello Braglia & Davide Castellano & Marco Frosolini, 2016. "Approximated closed-form minimum-cost solutions to the (S − 1, S) policy with complete backordering," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 8(1), pages 1-27.
    • Handle: RePEc:ids:ijmore:v:8:y:2016:i:1:p:1-27
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=73276
    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:8:y:2016:i:1:p:1-27. 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.