Author
Listed:
- Roman Kapuściński
(The University of Michigan, Ross School of Business, Ann Arbor, Michigan 48109)
- Rodney P. Parker
(Indiana University, Kelley School of Business, Bloomington, Indiana 47405)
Abstract
For serial multiechelon systems subject to production capacity limits at every stage, we consider a class of modified echelon base stock ( MEBS ) policies. To evaluate information requirements of such systems, we consider two separate inventory management mechanisms operated in a decentralized manner. For ordering decisions, these mechanisms utilize local knowledge only and are distinguished by the timing of the orders being conveyed upstream from installation to installation. We demonstrate that these mechanisms can duplicate the shipment quantities in the modified echelon base-stock policy that uses full information. Thus, although full demand information will not be conveyed up the channel due to the demand censoring effects of capacity, we demonstrate that sufficient information about the market demand is conveyed via the orders. This suggests that local information is sufficient to make ordering decisions that replicate the policy’s orders, a significant finding for implementing supply chain inventory policies in practice, where dynamic state information may not be readily accessible. We extend this local information result to serial channels with completely general capacity configurations acting under the corresponding echelon policies. We demonstrate the strong relationship between these two mechanisms that relate to serial capacitated channels of differing lengths. We augment our main results with two important extensions. (1) Because our focus is on MEBS policies, which are not necessarily optimal for longer supply chains, we evaluate their performance. We numerically show that they perform very well in general. We also provide upper and lower bounds, which further justify their strong performance. Given that these policies are close to optimal, that they are easy to interpret, and that they can operate with only local information, they are appealing in practical applications. (2) We compare the usage of local information to operate a capacitated system versus incentives to sustain such a system. We show that, similar to the noncapacitated case, it is possible to design an alternative incentive-compatible performance mechanism such that local managers will follow the centralized solution, albeit with more demanding information requirements.
Suggested Citation
Roman Kapuściński & Rodney P. Parker, 2022.
"Conveying Demand Information in Serial Supply Chains with Capacity Limits,"
Operations Research, INFORMS, vol. 70(3), pages 1485-1505, May.
Handle:
RePEc:inm:oropre:v:70:y:2022:i:3:p:1485-1505
DOI: 10.1287/opre.2021.2251
Download full text from publisher
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:70:y:2022:i:3:p:1485-1505. 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.