UCB-Type Learning Algorithms for Lost-Sales Inventory Models with Lead Times

2021 ◽  
Author(s):  
Chengyi Lyu ◽  
Huanan Zhang ◽  
Linwei Xin
2016 ◽  
Vol 41 (3) ◽  
pp. 898-913 ◽  
Author(s):  
David A. Goldberg ◽  
Dmitriy A. Katz-Rogozhnikov ◽  
Yingdong Lu ◽  
Mayank Sharma ◽  
Mark S. Squillante

2020 ◽  
Vol 68 (4) ◽  
pp. 1063-1073 ◽  
Author(s):  
Jinzhi Bu ◽  
Xiting Gong ◽  
Dacheng Yao

Asymptotic analysis of constant-order policies for lost-sales inventory models with positive lead times and random supply functions.


2021 ◽  
Author(s):  
Linwei Xin

Stochastic inventory systems with lead times are often challenging to optimize, including single-sourcing lost-sales and dual-sourcing systems. Recent numerical results suggest that capped policies demonstrate superior performance over existing heuristics. However, the superior performance lacks a theoretical foundation. In “1.79-Approximation Algorithms for Continuous Review Single-Sourcing Lost-Sales and Dual-Sourcing Inventory Models,” the author provides a theoretical foundation for this phenomenon in two classical inventory models. First, in a continuous review lost-sales model with lead times and Poisson demand, he proves that a capped base-stock policy has a worst-case performance guarantee of 1.79 by conducting an asymptotic analysis under a large penalty cost and lead time. Second, in a more complex continuous review dual-sourcing model with general lead times and Poisson demand, he proves that a similar capped dual-index policy has a worst-case performance guarantee of 1.79 under large lead time and ordering cost differences. The results provide a deeper understanding of the superior numerical performance of capped policies and present a new approach to proving worst-case performance guarantees of simple policies in hard inventory problems.


Sign in / Sign up

Export Citation Format

Share Document