IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v33y1986i1p111-122.html
   My bibliography  Save this article

Minimal forecast horizon procedures for dynamic lot size models

Author

Listed:
  • Suresh Chand
  • Thomas E. Morton

Abstract

This article presents new results which should be useful in finding production decisions while solving the dynamic lot sizing problem of Wagner–Whitin on a rolling horizon basis. In a rolling horizon environment, managers obtain decisions for the first period (or the first few periods) by looking at the forecasts for several periods. This article develops procedures to find optimal decisions for any specified number of initial periods (called planning horizon in the article) by using the forecast data for the minimum possible number of future periods. Computational results comparing these procedures with the other procedures reported in the literature are very encouraging.

Suggested Citation

  • Suresh Chand & Thomas E. Morton, 1986. "Minimal forecast horizon procedures for dynamic lot size models," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(1), pages 111-122, February.
    • Handle: RePEc:wly:navlog:v:33:y:1986:i:1:p:111-122
    DOI: 10.1002/nav.3800330110
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800330110
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800330110?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. 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.
    2. Stanislaw Bylka, 1997. "Strong turnpike policies in the single‐item capacitated lot‐sizing problem with periodical dynamic parameter," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(8), pages 775-790, December.
    3. 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.
    4. 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.
    5. 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.
    6. Shen Hong & Deng Qiang & Lao Rebecca & Wu Simon, 2016. "A Case Study of Inventory Management in a Manufacturing Company in China," Nang Yan Business Journal, Sciendo, vol. 5(1), pages 20-40, December.
    7. Suresh Chand & Sunantha Teyarachakul Prime & Suresh Sethi, 2018. "Production planning with multiple production lines: Forward algorithm and insights on process design for volume flexibility," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(6-7), pages 535-549, September.
    8. Awi Federgruen & Michal Tzur, 1999. "Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 463-486, August.

    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:navlog:v:33:y:1986:i:1:p:111-122. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.