Article ID: | iaor20164671 |
Volume: | 63 |
Issue: | 3 |
Start Page Number: | 602 |
End Page Number: | 609 |
Publication Date: | Jun 2015 |
Journal: | Operations Research |
Authors: | Bensoussan Alain, Guo Pengfei |
Keywords: | management, demand, supply & supply chains, queues: applications, learning, programming: dynamic, simulation, combinatorial optimization |
We study a periodic review inventory model with a nonperishable product over an infinite planning horizon. The demand for the nonperishable product arrives according to a Poisson process. Lost sales are unobservable but the stockout times are observable. We formulate the problem as a dynamic programming model with learning on arrival rate according to stockout times and further simplify it by using unnormalized probabilities. We then compare the system performance with those under other two information scenarios where lost sales are observable or both lost sales and stockout times are unobservable. We show that the optimal inventory order‐up‐to level with observable stockout times is larger than the one with observable lost sales. We also show that more information improves the system performance.