IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v28y1980i2p353-364.html
   My bibliography  Save this article

Evaluating the Effectiveness of a New Method for Computing Approximately Optimal ( s , S ) Inventory Policies

Author

Listed:
  • James R. Freeland

    (Stanford University, Stanford, California)

  • Evan L. Porteus

    (Stanford University, Stanford, California)

Abstract

A new method for obtaining approximately optimal ( s , S ) inventory policies was presented recently as an illustration of a general approximation methodology proposed by Porteus. This paper seeks to evaluate that method numerically Our numerical work showed that when demand was normally distributed the method performed very well. The performance was good but diminished somewhat when demand followed a negative binomial distribution which was approximated by a normal distribution for purposes of the method. The empirical method of Wagner, O'Hagan and Lundh was evaluated concurrently. It also performed very well. Although its performance was not as good as that of the new method, it required less computational effort. The question of whether one of these approximate methods can provide improved performance in practical periodic review systems was raised. A partial answer was obtained by examining the performance of policies found by using a continuous review model. Both the new method and the empirical method outperformed these policies.

Suggested Citation

  • James R. Freeland & Evan L. Porteus, 1980. "Evaluating the Effectiveness of a New Method for Computing Approximately Optimal ( s , S ) Inventory Policies," Operations Research, INFORMS, vol. 28(2), pages 353-364, April.
    • Handle: RePEc:inm:oropre:v:28:y:1980:i:2:p:353-364
    DOI: 10.1287/opre.28.2.353
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Chan, Gin Hor & Song, Yuyue, 2003. "A dynamic analysis of the single-item periodic stochastic inventory system with order capacity," European Journal of Operational Research, Elsevier, vol. 146(3), pages 529-542, May.
    2. Kleijnen, J.P.C. & Wan, J., 2007. "Optimization of simulated systems : OptQuest and alternatives [also see “Simulation for the optimization of (s, S) inventory system with random lead times and a service level constraint by using Arena," Other publications TiSEM ffaee312-9f6a-4452-9ccc-9, Tilburg University, School of Economics and Management.
    3. Tarim, S. Armagan & Smith, Barbara M., 2008. "Constraint programming for computing non-stationary (R, S) inventory policies," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1004-1021, September.
    4. Zied Babai, M. & Syntetos, Aris A. & Teunter, Ruud, 2010. "On the empirical performance of (T, s, S) heuristics," European Journal of Operational Research, Elsevier, vol. 202(2), pages 466-472, April.
    5. Kilic, Onur A. & Tarim, S. Armagan, 2024. "A simple heuristic for computing non-stationary inventory policies based on function approximation," European Journal of Operational Research, Elsevier, vol. 316(3), pages 899-905.

    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:inm:oropre:v:28:y:1980:i:2:p:353-364. 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.