IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v34y1987i6p761-774.html
   My bibliography  Save this article

Forecast horizons for the discounted dynamic lot‐size problem allowing speculative motive

Author

Listed:
  • James C. Bean
  • Robert L. Smith
  • Candace A. Yano

Abstract

This article considers the dynamic lot‐size problem under discounting, allowing speculative motive for holding inventory. A variable rolling‐horizon procedure is presented, which, under certain regularity conditions, is guaranteed to generate an infinite‐horizon optimal‐production plan. We also discuss a fixed rolling‐horizon procedure which provides a production plan that achieves an infinite‐horizon cost within a user‐specified tolerance ϵ of optimality. The fixed‐horizon length T* needed in this procedure is given in terms of a closed‐form formula that is independent of specific forecasted demands. We also present computational results for problems with a range of cost parameters and demand characteristics.

Suggested Citation

  • James C. Bean & Robert L. Smith & Candace A. Yano, 1987. "Forecast horizons for the discounted dynamic lot‐size problem allowing speculative motive," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 761-774, December.
    • Handle: RePEc:wly:navres:v:34:y:1987:i:6:p:761-774
    DOI: 10.1002/1520-6750(198712)34:63.0.CO;2-X
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198712)34:63.0.CO;2-X
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198712)34:63.0.CO;2-X?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
    ---><---

    References listed on IDEAS

    as
    1. Gary D. Eppen & F. J. Gould & B. Peter Pashigian, 1969. "Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model," Management Science, INFORMS, vol. 15(5), pages 268-277, January.
    2. Edward Zabel, 1964. "Some Generalizations of an Inventory Planning Horizon Theorem," Management Science, INFORMS, vol. 10(3), pages 465-471, April.
    3. James C. Bean & Robert L. Smith, 1984. "Conditions for the Existence of Planning Horizons," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 391-401, August.
    4. Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
    5. Joseph D. Blackburn & Howard Kunreuther, 1974. "Planning Horizons for the Dynamic Lot Size Model with Backlogging," Management Science, INFORMS, vol. 21(3), pages 251-255, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Awi Federgruen & Michal Tzur, 1993. "The dynamic lot‐sizing model with backlogging: A simple o(n log n) algorithm and minimal forecast horizon procedure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 459-478, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    2. Archis Ghate & Robert L. Smith, 2009. "Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 362-368, June.
    3. Robert L. Smith & Rachel Q. Zhang, 1998. "Infinite Horizon Production Planning in Time-Varying Systems with Convex Production and Inventory Costs," Management Science, INFORMS, vol. 44(9), pages 1313-1320, September.
    4. Suresh Chand & Vernon Ning Hsu & Suresh Sethi, 2002. "Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography," Manufacturing & Service Operations Management, INFORMS, vol. 4(1), pages 25-43, September.
    5. Kimms, Alf, 1996. "Stability measures for rolling schedules with applications to capacity expansion planning, master production scheduling, and lot sizing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 418, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Kimms, A, 1998. "Stability Measures for Rolling Schedules with Applications to Capacity Expansion Planning, Master Production Scheduling, and Lot Sizing," Omega, Elsevier, vol. 26(3), pages 355-366, June.
    7. 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.
    8. Alain Bensoussan & Jean‐Marie Proth & Maurice Queyranne, 1991. "A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 729-742, October.
    9. Awi Federgruen & Michal Tzur, 1996. "Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 169-189, March.
    10. S. Selcuk Erenguc, 1988. "Multiproduct dynamic lot‐sizing model with coordinated replenishments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 1-22, February.
    11. Karla E. Bourland & Candace Arai Yano, 1996. "Lot sizing when yields increase during the production run," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1035-1047, December.
    12. Awi Federgruen & Michal Tzur, 1993. "The dynamic lot‐sizing model with backlogging: A simple o(n log n) algorithm and minimal forecast horizon procedure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 459-478, June.
    13. Michael Bastian, 1992. "A perfect lot‐tree procedure for the discounted dynamic lot‐size problem with speculation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 651-668, August.
    14. Richter, Knut & Sombrutzki, Mirko, 2000. "Remanufacturing planning for the reverse Wagner/Whitin models," European Journal of Operational Research, Elsevier, vol. 121(2), pages 304-315, March.
    15. Bhattacharjee, Sudip & Ramesh, R., 2000. "A multi-period profit maximizing model for retail supply chain management: An integration of demand and supply-side mechanisms," European Journal of Operational Research, Elsevier, vol. 122(3), pages 584-601, May.
    16. Marshall Fisher & Kamalini Ramdas & Yu-Sheng Zheng, 2001. "Ending Inventory Valuation in Multiperiod Production Scheduling," Management Science, INFORMS, vol. 47(5), pages 679-692, May.
    17. Seksan Kiatsupaibul & Robert L. Smith & Zelda B. Zabinsky, 2016. "Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem," Journal of Global Optimization, Springer, vol. 66(4), pages 711-727, December.
    18. Torpong Cheevaprawatdomrong & Robert L. Smith, 2004. "Infinite Horizon Production Scheduling in Time-Varying Systems Under Stochastic Demand," Operations Research, INFORMS, vol. 52(1), pages 105-115, February.
    19. Shiono, Naoshi & Suzuki, Hisatoshi & Saruwatari, Yasufumi, 2019. "A dynamic programming approach for the pipe network layout problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 52-61.
    20. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.

    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:wly:navres:v:34:y:1987:i:6:p:761-774. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.