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

Forecasting and information sharing in supply chains under ARMA demand

Author

Listed:
  • Avi Giloni
  • Clifford Hurvich
  • Sridhar Seshadri

Abstract

This article considers the problem of determining the value of information sharing in a multi-stage supply chain in which the retailer faces AutoRegressive Moving Average (ARMA) demand, all players use a myopic order-up-to policy, and information sharing can only occur between adjacent players in the chain. It is shown that an upstream supply chain player can determine whether information sharing is of any value directly from the parameters of the model for the adjacent downstream player's order. This can be done by examining the location of the roots of the moving average polynomial of the model for the downstream player's order. If at least one of these roots is inside the unit circle or if the polynomial is applied to a lagged set of the downstream player's shocks, there is value of information sharing for the upstream player. It is also shown that under credible assumptions, neither player k−1's order nor player k's demand is necessarily an ARMA process with respect to the relevant shocks. It is shown that demand activity propagates in general to a process that is called quasi-ARMA, or QUARMA, in which the most recent shock(s) may be absent. It is shown that the typical player faces QUARMA demand and places orders that are also QUARMA. Thus, the demand propagation model is QUARMA in–QUARMA out. The presented analysis hence reverses and sharpens several previous results in the literature involving information sharing and also opens up many questions for future research.

Suggested Citation

  • Avi Giloni & Clifford Hurvich & Sridhar Seshadri, 2014. "Forecasting and information sharing in supply chains under ARMA demand," IISE Transactions, Taylor & Francis Journals, vol. 46(1), pages 35-54.
  • Handle: RePEc:taf:uiiexx:v:46:y:2014:i:1:p:35-54
    DOI: 10.1080/0740817X.2012.689122
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/0740817X.2012.689122?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. Ruomeng Cui & Gad Allon & Achal Bassamboo & Jan A. Van Mieghem, 2015. "Information Sharing in Supply Chains: An Empirical and Theoretical Valuation," Management Science, INFORMS, vol. 61(11), pages 2803-2824, November.
    2. Kovtun, Vladimir & Giloni, Avi & Hurvich, Clifford, 2019. "The value of sharing disaggregated information in supply chains," European Journal of Operational Research, Elsevier, vol. 277(2), pages 469-478.
    3. Ketzenberg, Michael & Oliva, Rogelio & Wang, Yimin & Webster, Scott, 2023. "Retailer inventory data sharing in a fresh product supply chain," European Journal of Operational Research, Elsevier, vol. 307(2), pages 680-693.
    4. Vladimir Kovtun & Avi Giloni & Clifford Hurvich, 2014. "Assessing the value of demand sharing in supply chains," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(7), pages 515-531, October.
    5. Lu, Jizhou & Feng, Gengzhong & Shum, Stephen & Lai, Kin Keung, 2021. "On the value of information sharing in the presence of information errors," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1139-1152.
    6. Bin Shen & Hau-Ling Chan, 2017. "Forecast Information Sharing for Managing Supply Chains in the Big Data Era: Recent Development and Future Research," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(01), pages 1-26, February.
    7. Vladimir Kovtun & Avi Giloni & Clifford Hurvich & Sridhar Seshadri, 2023. "Pivot Clustering to Minimize Error in Forecasting Aggregated Demand Streams Each Following an Autoregressive Moving Average Model," Stats, MDPI, vol. 6(4), pages 1-28, November.

    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:46:y:2014:i:1:p:35-54. 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.