Affiliation:
1. International Institute of Finance, School of Management, University of Science and Technology of China, Hefei, Anhui, China
2. College of Business, City University of Hong Kong, Kowloon, Hong Kong SAR
3. SILC Business School, Shanghai University, Shanghai, China
Abstract
In practice, it is common, especially for online retailers, to bundle different products together during procurement to save transportation and handling costs. It is important to understand and theorize how to manage dynamic procurement by taking advantage of joint ordering in the presence of joint and individual setup costs. In this article, we characterize the structure of optimal policy for a periodic review multiproduct inventory system with multiple setup costs, including a joint setup cost and an individual setup cost for each product. By proposing the notion of [Formula: see text]-quasi-convexity, we show that an optimal procurement policy for such a system follows the so-called ([Formula: see text]) policy when demands increase stochastically over time: order up to [Formula: see text] for states in the region [Formula: see text], do not order for states in the region [Formula: see text], and order certain quantities for states in neither [Formula: see text] nor [Formula: see text]. To better understand the optimal policy, we provide the bounds for the optimal order-up-to levels and the boundary sets of the optimal policy. Under the convex single-period inventory costs, we also provide a lower bound deterministic system which can be asymptotically optimal as the coefficient of variations decreases to zero. Leveraging these operational insights, we propose five simple heuristic policies: the independent ([Formula: see text]) policy, vector ([Formula: see text]) policy, linear interpolation ([Formula: see text]) policy, the deterministic approximation, and the weighted deterministic approximation policy. Extensive numerical experiments indicate that the last three heuristics perform well. In particular, the weighted deterministic approximation policy, whose average performance gap is < 1%, dominates the others in almost all our numerical experiments. Finally, we show that how our results can be extended to systems with more complex setup cost functions, such as time-varying, set-based, and quantity-dependent setup costs.
Funder
National Natural Science Foundation of China
Research Grants Council, University Grants Committee
City University of Hong Kong
Laboratory for AI-Powered Financial Technologies
the USTC Research Funds of the Double First-Class Initiative