Learning to Order for Inventory Systems with Lost Sales and Uncertain Supplies

• 成果类型: Article
• 署名作者: Chen, Boxiao; Jiang, Jiashuo; Zhang, Jiawei; Zhou, Zhengyuan
• 署名单位: University of Illinois System; University of Illinois Chicago; University of Illinois Chicago Hospital; Hong Kong University of Science & Technology; New York University
• 刊物名称: MANAGEMENT SCIENCE
• ISSN/ISSBN: 0025-1909
• DOI: 10.1287/mnsc.2022.02476
• 发表日期: 2025
• 关键词: lost sales; lead time; supply uncertainty; online learning; censored data

摘要

We consider a stochastic lost-sales inventory control system with lead time L over a planning horizon T. Supply is uncertain, and it is a function of the order quantity (because of random yield/capacity, etc.). We aim to minimize the T-period cost, a problem that is known to be computationally intractable even under known distributions of demand and supply. In this paper, we assume that both the demand and supply distributions are unknown and develop a computationally efficient online learning algorithm. We show that our algorithm achieves a regret (i.e., the performance gap between the cost of our algorithm and that of an optimal policy over T periods) of O(L+root T) when L >= Omega(log T). We do so by (1) showing that our algorithm's cost is higher by at most O(L+root T) for any L >= 0 compared with an optimal constant-order policy under complete information (a widely used algorithm) and (2) leveraging the latter's known performance guarantee from the existing literature. To the best of our knowledge, a finite sample O(root T) (and polynomial in L) regret bound when benchmarked against an optimal policy is not known before in the online inventory control literature. A key challenge in this learning problem is that both demand and supply data can be censored; hence, only truncated values are observable. We circumvent this challenge by showing that the data generated under an order quantity q(2) allow us to simulate the performance of not only q(2) but also, q(1) for all q(1 )< q(2), a key observation to obtain sufficient information even under data censoring. By establishing a high-probability coupling argument, we are able to evaluate and compare the performance of different order policies at their steady state within a finite time horizon. Because the problem lacks convexity, commonly used learning algorithms, such as stochastic gradient decent and bisection, cannot be applied, and instead, we develop an active elimination method that adaptively rules out suboptimal solutions.