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

A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs

Author

Listed:
  • Edward P. C. Kao

    (University of Houston, Houston, Texas)

Abstract

This paper considers a multi-product dynamic lot-size problem. In addition to a separate set-up cost for each product ordered, a joint set-up cost is incurred when one or more products are ordered. We present a dynamic programming formulation for finding the optimal ordering policy that calls for a smaller state space than that proposed by Zangwill. As a convenient substitute, we also introduce a very simple heuristic procedure and two of its variants. For the two-product problem we report computational experience for evaluating the performance of these procedures.

Suggested Citation

  • Edward P. C. Kao, 1979. "A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs," Operations Research, INFORMS, vol. 27(2), pages 279-289, April.
    • Handle: RePEc:inm:oropre:v:27:y:1979:i:2:p:279-289
    DOI: 10.1287/opre.27.2.279
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.27.2.279
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.27.2.279?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. Danny Segev, 2014. "An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 432-444, May.
    2. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
    3. Tsao, Yu-Chung & Sheen, Gwo-Ji, 2012. "A multi-item supply chain with credit periods and weight freight cost discounts," International Journal of Production Economics, Elsevier, vol. 135(1), pages 106-115.
    4. Martel, Alain & Diaby, Moustapha & Boctor, Fayez, 1995. "Multiple items procurement under stochastic nonstationary demands," European Journal of Operational Research, Elsevier, vol. 87(1), pages 74-92, November.
    5. J-M Chen & T-H Chen, 2005. "Effects of joint replenishment and channel coordination for managing multiple deteriorating products in a supply chain," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1224-1234, October.
    6. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.
    7. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    8. Fuying Jing & Zirui Lan, 2017. "Forecast horizon of multi-item dynamic lot size model with perishable inventory," PLOS ONE, Public Library of Science, vol. 12(11), pages 1-15, November.
    9. Monalisha Pattnaik & Padmabati Gahan, 2021. "Preservation effort effects on retailers and manufacturers in integrated multi-deteriorating item discrete supply chain model," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 276-329, June.
    10. Retsef Levi & Robin O. Roundy & David B. Shmoys, 2006. "Primal-Dual Algorithms for Deterministic Inventory Problems," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 267-284, May.
    11. Narayanan, Arunachalam & Robinson, Powell, 2010. "Efficient and effective heuristics for the coordinated capacitated lot-size problem," European Journal of Operational Research, Elsevier, vol. 203(3), pages 583-592, June.
    12. Lu, Liang & Qi, Xiangtong, 2011. "Dynamic lot sizing for multiple products with a new joint replenishment model," European Journal of Operational Research, Elsevier, vol. 212(1), pages 74-80, July.
    13. E P Robinson & A Narayanan & L-L Gao, 2007. "Effective heuristics for the dynamic demand joint replenishment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 808-815, June.
    14. Chung, Chia-Shin & Hum, Sin-Hoon & Kirca, Omer, 1996. "The coordinated replenishment dynamic lot-sizing problem with quantity discounts," European Journal of Operational Research, Elsevier, vol. 94(1), pages 122-133, October.

    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:27:y:1979:i:2:p:279-289. 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.