IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v45y2013i3p323-340.html
   My bibliography  Save this article

Forecast and rolling horizons under demand substitution and production changeovers: analysis and insights

Author

Listed:
  • Amit Bardhan
  • Milind Dawande
  • Srinagesh Gavirneni
  • Yinping Mu
  • Suresh Sethi

Abstract

For most multi-period decision-making problems, it is generally well accepted that the influence of information about later periods on the optimal decision in the current period reduces as we move farther into the future. If and when this influence reduces to zero, the corresponding problem horizon is referred to as a forecast horizon. For real businesses, the problem of obtaining a minimal forecast horizon becomes relevant because the task of estimating reliable data for future periods gets progressively more challenging and expensive. This article investigates forecast horizons for a two-product dynamic lot-sizing model under (i) the possibility of substitution in one direction; that is, one product can be used to satisfy the demand of the other product but not vice versa; and (ii) a changeover cost when production switches from one product to the other. It is assumed that only one of the two products can be produced in a period. The notion of substitution, due to the inherent flexibility it offers, has recently been recognized as an effective tool to improve the efficiency of multi-product inventory systems. The concept of regeneration points is used to justify the use of a practically relevant restricted version of the problem to obtain forecast horizons. A dynamic programming-based polynomial-time algorithm for the restricted version is developed and, subsequently, an efficient procedure for obtaining minimal forecast horizons by establishing the monotonicity of the regeneration points is obtained. Using a comprehensive test bed of instances, useful insights are obtained on the impact of substitution and production changeovers on the length of the minimal forecast horizons. Finally, for infinite-horizon problems, a practical rolling-horizon procedure is developed that uses forecasting costs to balance the benefit of additional information. It is shown that, instead of fixing the duration of the rolling horizon at a predetermined value, changing it dynamically based on the lengths of the minimal forecast horizons can significantly reduce the combined production and forecasting cost.[Supplemental materials are available for this article. Go to the publisher’s online edition of IIE Transactions to view the supplemental file.]

Suggested Citation

  • Amit Bardhan & Milind Dawande & Srinagesh Gavirneni & Yinping Mu & Suresh Sethi, 2013. "Forecast and rolling horizons under demand substitution and production changeovers: analysis and insights," IISE Transactions, Taylor & Francis Journals, vol. 45(3), pages 323-340.
  • Handle: RePEc:taf:uiiexx:v:45:y:2013:i:3:p:323-340
    DOI: 10.1080/0740817X.2012.712239
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2012.712239
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2012.712239?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Feng Xue & Qiumin Li, 2024. "Forecast Horizon of Dynamic Lot Sizing Problem with Perishable Inventory and Multiple Chain Stores: Shipping and Stockout Cost," Mathematics, MDPI, vol. 12(13), pages 1-17, July.
    2. 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.
    3. Jing, Fuying & Chao, Xiangrui, 2022. "Forecast horizons for a two-echelon dynamic lot-sizing problem," Omega, Elsevier, vol. 110(C).
    4. Chen, Xu & Feng, Youyi & Keblis, Matthew F. & Xu, Jianjun, 2015. "Optimal inventory policy for two substitutable products with customer service objectives," European Journal of Operational Research, Elsevier, vol. 246(1), pages 76-85.
    5. 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.

    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:taf:uiiexx:v:45:y:2013:i:3:p:323-340. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.