Conveying Demand Information in Serial Supply Chains with Capacity Limits

Oper. Res. Pub Date : 2022-02-23 DOI:10.2139/ssrn.3984277
R. Kapuscinski, Rodney P. Parker
{"title":"Conveying Demand Information in Serial Supply Chains with Capacity Limits","authors":"R. Kapuscinski, Rodney P. Parker","doi":"10.2139/ssrn.3984277","DOIUrl":null,"url":null,"abstract":"Supply chains are distributed across multiple locations, and to effectively manage inventory in these channels requires knowledge of inventory levels at many sites. Such information is changing dynamically, so it is unrealistic to expect such information to be readily available, especially in channels with production capacity limits. In “Conveying Demand Information in Serial Supply Chains with Capacity Limits,” Kapuscinski and Parker show that local information alone is sufficient to effectively manage inventory in capacity-limited supply chains. In supply chains with capacity limits, the retailer does not faithfully pass the demand information to her supplier but sends censored information in her order. Despite censoring, these orders contain sufficient information for the modified echelon base-stock policy, a full-information policy, to be mimicked. They provide evidence using numerical experiments and analytical bounds that the modified echelon base-stock policy performs superbly. Also, they describe information requirements used in supply chain literature and demonstrate that with an incentive-compatible mechanism, similar to Lee and Whang (2000), local managers will follow the centralized inventory policy.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"05 1","pages":"1485-1505"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3984277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Supply chains are distributed across multiple locations, and to effectively manage inventory in these channels requires knowledge of inventory levels at many sites. Such information is changing dynamically, so it is unrealistic to expect such information to be readily available, especially in channels with production capacity limits. In “Conveying Demand Information in Serial Supply Chains with Capacity Limits,” Kapuscinski and Parker show that local information alone is sufficient to effectively manage inventory in capacity-limited supply chains. In supply chains with capacity limits, the retailer does not faithfully pass the demand information to her supplier but sends censored information in her order. Despite censoring, these orders contain sufficient information for the modified echelon base-stock policy, a full-information policy, to be mimicked. They provide evidence using numerical experiments and analytical bounds that the modified echelon base-stock policy performs superbly. Also, they describe information requirements used in supply chain literature and demonstrate that with an incentive-compatible mechanism, similar to Lee and Whang (2000), local managers will follow the centralized inventory policy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
产能限制下串行供应链的需求信息传递
供应链分布在多个地点,为了有效地管理这些渠道中的库存,需要了解许多地点的库存水平。这些信息是动态变化的,因此期望随时获得这些信息是不现实的,特别是在生产能力有限的渠道中。在《在产能有限的连续供应链中传递需求信息》一文中,Kapuscinski和Parker指出,在产能有限的供应链中,仅本地信息就足以有效地管理库存。在有容量限制的供应链中,零售商没有忠实地将需求信息传递给供应商,而是在订单中发送经过审查的信息。尽管经过审查,这些订单包含了足够的信息,可以用来模仿修改后的梯队基本库存政策,即一种全信息政策。他们通过数值实验和分析边界提供了证据,证明改进的梯队基础种群策略具有优异的性能。此外,他们描述了供应链文献中使用的信息需求,并证明了与激励兼容的机制,类似于Lee和Whang(2000),地方管理者将遵循集中库存政策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A web-based multi-criteria decision support system for benchmarking marketing decisions alternatives Integrated optimization of wagon flow routing and train formation plan Two-machine decentralized flow shop scheduling problem with inter-factory batch delivery system A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints Meta-frontier: literature review and toolkit
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1