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

Technical Note—Comparison between Two Dynamic Perishable Inventory Models

Author

Listed:
  • Steven Nahmias

    (University of Pittsburgh, Pittsburgh, Pennsylvania)

Abstract

Two apparently different inventory models for describing optimal ordering policies for a fixed life commodity have been developed by Fries and Nahmias. This note considers the relationship between these models. Our main result is that the optimal policies for Fries' model and a discounted version of Nahmias' are identical when the remaining number of periods in the horizon exceeds the product lifetime in periods. We also discuss the relevance of these results to the computation of an approximate critical number policy developed elsewhere.

Suggested Citation

  • Steven Nahmias, 1977. "Technical Note—Comparison between Two Dynamic Perishable Inventory Models," Operations Research, INFORMS, vol. 25(1), pages 168-172, February.
    • Handle: RePEc:inm:oropre:v:25:y:1977:i:1:p:168-172
    DOI: 10.1287/opre.25.1.168
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.25.1.168
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.25.1.168?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. Hailun Zhang & Jiheng Zhang & Rachel Q. Zhang, 2020. "Simple Policies with Provable Bounds for Managing Perishable Inventory," Production and Operations Management, Production and Operations Management Society, vol. 29(11), pages 2637-2650, November.
    2. Xiuli Chao & Xiting Gong & Cong Shi & Huanan Zhang, 2015. "Approximation Algorithms for Perishable Inventory Systems," Operations Research, INFORMS, vol. 63(3), pages 585-601, June.
    3. Xiuli Chao & Xiting Gong & Cong Shi & Chaolin Yang & Huanan Zhang & Sean X. Zhou, 2018. "Approximation Algorithms for Capacitated Perishable Inventory Systems with Positive Lead Times," Management Science, INFORMS, vol. 64(11), pages 5038-5061, November.

    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:25:y:1977:i:1:p:168-172. 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.