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

Note---A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions

Author

Listed:
  • Meir J. Rosenblatt

    (Industrial Engineering/Engineering Management Department, Stanford University, Stanford, California 94305)

  • Moshe Kaspi

    (Faculty of Industrial Engineering and Management, Technion---Israel Institute of Technology, Haifa, Israel)

Abstract

The multi-item joint replenishment problem is generalized to allow ordering costs to be dependent on the specific items jointly supplied. A fixed cycle approach is examined in which all the items of a group are always jointly replenished. A dynamic programming algorithm is developed for partitioning the items into groups, each with its own fixed cycle time, resulting in an optimal fixed cycle replenishment policy.

Suggested Citation

  • Meir J. Rosenblatt & Moshe Kaspi, 1985. "Note---A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions," Management Science, INFORMS, vol. 31(3), pages 369-373, March.
    • Handle: RePEc:inm:ormnsc:v:31:y:1985:i:3:p:369-373
    DOI: 10.1287/mnsc.31.3.369
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.31.3.369
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.31.3.369?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, 2005. "Duality and Existence of Optimal Policies in Generalized Joint Replenishment," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 28-50, February.
    2. 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.
    3. Matsuyama, Keisuke, 1995. "Inventory policy with time-dependent setup cost," International Journal of Production Economics, Elsevier, vol. 42(2), pages 149-160, December.
    4. Daniel Adelman, 2003. "Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing," Manufacturing & Service Operations Management, INFORMS, vol. 5(4), pages 348-371, May.
    5. S. Viswanathan, 2007. "An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem," Operations Research, INFORMS, vol. 55(5), pages 992-996, October.

    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:31:y:1985:i:3:p:369-373. 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.