Robust Inventory Management: A Cycle-Based Approach

Author:

Chen Yupeng1ORCID,Iyengar Garud2ORCID,Wang Chun3ORCID

Affiliation:

1. Division of Marketing, Nanyang Business School, Nanyang Technological University, Singapore 639798;

2. Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027;

3. Department of Management Science and Engineering, School of Economics and Management, Tsinghua University, Beijing 100084, China

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 .

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Strategy and Management

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3