On a Deterministic Approximation of Inventory Systems with Sequential Service-Level Constraints

Lai Wei (), Stefanus Jasin () and Linwei Xin ()
Additional contact information
Lai Wei: Carroll School of Management, Boston College, Chestnut Hill, Massachusetts 02467
Stefanus Jasin: Stephen M. Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109
Linwei Xin: Booth School of Business, University of Chicago, Chicago, Illinois 60637

Operations Research, 2021, vol. 69, issue 4, 1057-1076

Abstract: Service-level constraint is often used as a metric to directly control the quality of service (e.g., managing the probability of stockout) in practice. Many inventory problems with service-level constraints are often difficult to solve and are typically approximated by deterministic formulations. This raises an important question regarding the quality of such an approach. To shed light on this question, in this paper, we consider two simplified yet fundamental inventory models (with backorder and lost sales) with independent demands, positive lead times, and sequential probabilistic service-level constraints, and study the performance of a natural order-up-to policy whose parameters can be calculated using the optimal solution of a deterministic approximation of the backorder inventory system. We show that it is asymptotically optimal for both the backorder and lost-sales systems in the setting with a high service-level requirement with a stronger performance bound for the backorder system. Our analysis for the lost-sales system involves construction of an alternative backorder system whose expected total cost can be related to that of the analogous lost-sales system. Overall, our result contributes to the growing body of inventory literature that suggests the near optimality of simple heuristic policies. Moreover, it also gives credence to the use of deterministic approximation for solving complex inventory problems in practice, at least for applications in which the targeted service level is sufficiently high.

Keywords: dynamic programming; inventory/production: approximations/heuristics; policies; Operations and Supply Chains; inventory; service-level constraints; lost sales; deterministic approximation; linear programming; asymptotic optimality (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2020.2083 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:69:y:2021:i:4:p:1057-1076

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().