IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v36y1990i7p822-834.html
   My bibliography  Save this article

Power Approximation for Computing (s, S) Policies Using Service Level

Author

Listed:
  • Helmut Schneider

    (Department of Quantitative Business Analysis, Louisiana State University, Baton Rouge, Louisiana 70803)

  • Jeffrey L. Ringuest

    (Operations and Strategic Management Department, Boston College, Chestnut Hill, Massachusetts 02167)

Abstract

The paper presents an analytic approximation for computing (s, S) policies for single items under periodic review with fixed ordering costs, linear holding costs and a service level requirement. The replenishment lead time is fixed and unfilled demand is backlogged. The approximation is similar to Ehrhardt's "Power Approximation." However, we do not assume the knowledge of shortage costs, which are difficult to estimate in practice. We define a \gamma -service level which measures the average backlog relative to the average demand. This quantity is easy to understand and frequently used in practice. The resulting power approximation policies are easy to compute and require only knowledge of the mean and variance of demand. Computational results show that the approximation gives a \gamma -service level which is within one percentage point of the required service level in most cases. Furthermore, the expected total costs of the approximation, taking into consideration a penalty cost for stockouts, are well within one percent of optimal.

Suggested Citation

  • Helmut Schneider & Jeffrey L. Ringuest, 1990. "Power Approximation for Computing (s, S) Policies Using Service Level," Management Science, INFORMS, vol. 36(7), pages 822-834, July.
    • Handle: RePEc:inm:ormnsc:v:36:y:1990:i:7:p:822-834
    DOI: 10.1287/mnsc.36.7.822
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.36.7.822
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.36.7.822?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
    ---><---

    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:inm:ormnsc:v:36:y:1990:i:7:p:822-834. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.