稳健的库存管理:基于周期的方法

Yupeng Chen, G. Iyengar, Chun Wang
{"title":"稳健的库存管理:基于周期的方法","authors":"Yupeng Chen, G. Iyengar, Chun Wang","doi":"10.1287/msom.2022.1168","DOIUrl":null,"url":null,"abstract":"Problem definition: We study the robust formulation of an inventory model with positive fixed ordering costs, where the unfulfilled demand is either backlogged or lost, the lead time is allowed to be positive, the demand is potentially intertemporally correlated, and the information about the demand distribution is limited. Methodology/results: We propose a robust cycle-based policy that manages inventory by dividing the planning horizon into nonoverlapping inventory cycles, where an order is placed at the beginning of each cycle. Our policy selects the lengths and order quantities for all inventory cycles to minimize the worst-case total cost incurred over the planning horizon. When the uncertain demand belongs to a general polyhedral uncertainty set, the decisions in our policy can be computed by solving linear programs (LPs) for the backlogging model with any lead time and the lost-sales model with zero lead time; however, the number of LPs that need to be solved grows exponentially in the length of the planning horizon. In the special case where the uncertain demand belongs to a box uncertainty set, the decisions in our policy can be computed using a dynamic programming (DP) recursion whose complexity grows polynomially in the length of the planning horizon. We also propose a one-cycle look-ahead heuristic to handle large problem instances with a general polyhedral uncertainty set. This heuristic can be applied for both the backlogging and lost-sales models with any lead time, and it only requires solving LPs whose number grows quadratically in the length of the planning horizon. Results from extensive computational experiments clearly show that both a rolling-cycle implementation of our policy and the one-cycle look-ahead heuristic have very strong empirical performance. Managerial implications: Our robust cycle-based policy and the one-cycle look-ahead heuristic are conceptually simple and can accommodate multiple realistic features in inventory management problems. They provide a very effective approach to robust inventory management, especially in the lost-sales setting. Funding: Y. Chen was supported by a start-up grant from Nanyang Technological University. C. Wang was supported by the National Natural Science Foundation of China [Grant 71802115] and the Tsinghua University Initiative Scientific Research Program. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1168 .","PeriodicalId":18108,"journal":{"name":"Manuf. Serv. Oper. Manag.","volume":"49 1","pages":"581-594"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust Inventory Management: A Cycle-Based Approach\",\"authors\":\"Yupeng Chen, G. Iyengar, Chun Wang\",\"doi\":\"10.1287/msom.2022.1168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Problem definition: We study the robust formulation of an inventory model with positive fixed ordering costs, where the unfulfilled demand is either backlogged or lost, the lead time is allowed to be positive, the demand is potentially intertemporally correlated, and the information about the demand distribution is limited. Methodology/results: We propose a robust cycle-based policy that manages inventory by dividing the planning horizon into nonoverlapping inventory cycles, where an order is placed at the beginning of each cycle. Our policy selects the lengths and order quantities for all inventory cycles to minimize the worst-case total cost incurred over the planning horizon. When the uncertain demand belongs to a general polyhedral uncertainty set, the decisions in our policy can be computed by solving linear programs (LPs) for the backlogging model with any lead time and the lost-sales model with zero lead time; however, the number of LPs that need to be solved grows exponentially in the length of the planning horizon. In the special case where the uncertain demand belongs to a box uncertainty set, the decisions in our policy can be computed using a dynamic programming (DP) recursion whose complexity grows polynomially in the length of the planning horizon. We also propose a one-cycle look-ahead heuristic to handle large problem instances with a general polyhedral uncertainty set. This heuristic can be applied for both the backlogging and lost-sales models with any lead time, and it only requires solving LPs whose number grows quadratically in the length of the planning horizon. Results from extensive computational experiments clearly show that both a rolling-cycle implementation of our policy and the one-cycle look-ahead heuristic have very strong empirical performance. Managerial implications: Our robust cycle-based policy and the one-cycle look-ahead heuristic are conceptually simple and can accommodate multiple realistic features in inventory management problems. They provide a very effective approach to robust inventory management, especially in the lost-sales setting. Funding: Y. Chen was supported by a start-up grant from Nanyang Technological University. C. Wang was supported by the National Natural Science Foundation of China [Grant 71802115] and the Tsinghua University Initiative Scientific Research Program. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1168 .\",\"PeriodicalId\":18108,\"journal\":{\"name\":\"Manuf. Serv. Oper. Manag.\",\"volume\":\"49 1\",\"pages\":\"581-594\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Manuf. Serv. Oper. Manag.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/msom.2022.1168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manuf. Serv. Oper. Manag.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2022.1168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

问题定义:我们研究了一个具有正固定订购成本的库存模型的鲁棒公式,其中未满足的需求要么积压要么丢失,交货时间允许为正,需求可能是跨期相关的,并且关于需求分布的信息是有限的。方法/结果:我们提出了一个健壮的基于周期的策略,该策略通过将计划范围划分为不重叠的库存周期来管理库存,其中在每个周期的开始放置订单。我们的策略选择所有库存周期的长度和订单数量,以最小化在计划范围内发生的最坏情况总成本。当不确定需求属于一般多面体不确定性集时,我们的策略决策可以通过求解任意提前期的积压模型和零提前期的损失销售模型的线性规划(lp)来计算;然而,需要解决的有限合伙人数量在规划范围内呈指数级增长。在不确定需求属于盒子不确定集的特殊情况下,我们的策略决策可以使用动态规划(DP)递归来计算,其复杂度随规划视界的长度呈多项式增长。我们还提出了一种单周期前瞻性启发式方法来处理具有一般多面体不确定性集的大型问题实例。这种启发式方法可以应用于任何提前期的积压和销售损失模型,并且它只需要解决在规划范围内数量呈二次增长的有限合伙人。大量的计算实验结果清楚地表明,我们的策略的滚动周期实施和单周期前瞻性启发式都具有很强的经验性能。管理意义:我们健壮的基于周期的策略和单周期前瞻性启发式在概念上很简单,可以适应库存管理问题中的多种现实特征。它们为稳健的库存管理提供了一种非常有效的方法,特别是在销售损失的情况下。项目资助:陈毅获得南洋理工大学创业基金资助。国家自然科学基金[基金号:71802115]和清华大学自主科研计划资助项目。补充材料:在线附录可在https://doi.org/10.1287/msom.2022.1168上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Robust Inventory Management: A Cycle-Based Approach
Problem definition: We study the robust formulation of an inventory model with positive fixed ordering costs, where the unfulfilled demand is either backlogged or lost, the lead time is allowed to be positive, the demand is potentially intertemporally correlated, and the information about the demand distribution is limited. Methodology/results: We propose a robust cycle-based policy that manages inventory by dividing the planning horizon into nonoverlapping inventory cycles, where an order is placed at the beginning of each cycle. Our policy selects the lengths and order quantities for all inventory cycles to minimize the worst-case total cost incurred over the planning horizon. When the uncertain demand belongs to a general polyhedral uncertainty set, the decisions in our policy can be computed by solving linear programs (LPs) for the backlogging model with any lead time and the lost-sales model with zero lead time; however, the number of LPs that need to be solved grows exponentially in the length of the planning horizon. In the special case where the uncertain demand belongs to a box uncertainty set, the decisions in our policy can be computed using a dynamic programming (DP) recursion whose complexity grows polynomially in the length of the planning horizon. We also propose a one-cycle look-ahead heuristic to handle large problem instances with a general polyhedral uncertainty set. This heuristic can be applied for both the backlogging and lost-sales models with any lead time, and it only requires solving LPs whose number grows quadratically in the length of the planning horizon. Results from extensive computational experiments clearly show that both a rolling-cycle implementation of our policy and the one-cycle look-ahead heuristic have very strong empirical performance. Managerial implications: Our robust cycle-based policy and the one-cycle look-ahead heuristic are conceptually simple and can accommodate multiple realistic features in inventory management problems. They provide a very effective approach to robust inventory management, especially in the lost-sales setting. Funding: Y. Chen was supported by a start-up grant from Nanyang Technological University. C. Wang was supported by the National Natural Science Foundation of China [Grant 71802115] and the Tsinghua University Initiative Scientific Research Program. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1168 .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Introduction to Special Section on Data-Driven Research Challenge Food Donations, Retail Operations, and Retail Pricing The Design of Optimal Pay-as-Bid Procurement Mechanisms Asymmetric Information of Product Authenticity on C2C E-Commerce Platforms: How Can Inspection Services Help? Believing in Analytics: Managers' Adherence to Price Recommendations from a DSS
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1