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

Comment on "A Dynamic Programming Approach for Joint Replenishment Under General Order Cost Functions"

Author

Listed:
  • S. K. Goyal

    (Department of Quantitative Methods, Concordia University, 1455 de Maisonneuve Blvd. West, Montreal, Quebec, Canada H3G 1M8)

Abstract

Rosenblatt and Kaspi (Rosenblatt, M. J., M. Kaspi. 1985. A dynamic programming algorithm for joint replenishment under general order cost functions. Management Sci. 31 (March) 369--373.) suggested a dynamic programming algorithm for partitioning a number of items ordered from a single supplier. It was assumed that items belonging to a group have a fixed common ordering cycle. Queyranne (Queyranne, M. 1987. Comment on a dynamic programming algorithm for joint replenishment under general order cost. Management Sci. 33 (1, January) 131--133.) in his comments on Rosenblatt and Kaspi described the correct dynamic programming algorithm for this optional partitioning problem.

Suggested Citation

  • S. K. Goyal, 1987. "Comment on "A Dynamic Programming Approach for Joint Replenishment Under General Order Cost Functions"," Management Science, INFORMS, vol. 33(1), pages 133-135, January.
    • Handle: RePEc:inm:ormnsc:v:33:y:1987:i:1:p:133-135
    DOI: 10.1287/mnsc.33.1.133
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.33.1.133
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.33.1.133?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. Daniel Adelman & Diego Klabjan, 2012. "Computing Near-Optimal Policies in Generalized Joint Replenishment," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 148-164, February.

    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:ormnsc:v:33:y:1987:i:1:p:133-135. 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.