Serial Inventory Systems with Markov-Modulated Demand: Derivative Bounds, Asymptotic Analysis, and Insights
We study inventory control of serial supply chains with continuous, Markov-modulated demand (MMD). Our goal is to simplify the computational complexity by resorting to certain approximation techniques, and, in doing so, to gain a deeper understanding of the problem. First, we perform a derivative analysis of the problem’s optimality equations and develop general, analytical solution bounds for the optimal policy. This leads to simple-to-compute near-optimal heuristic solutions, which also reveal an intuitive relationship with the primitive model parameters. Second, we establish an MMD central limit theorem under long replenishment lead time through asymptotic analysis. We show that the relative errors between our heuristic and the optimal solutions converge to zero as the lead time becomes sufficiently long, with the rate of convergence being the square root of the lead time. Third, we show that, by leveraging the Laplace transform, the computational complexity of our heuristic is superior to the existing methods. Finally, we provide the first set of numerical study for serial systems under MMD. The numerical results demonstrate that our heuristic achieves near-optimal performance even under short lead times and outperforms alternative heuristics in the literature. In addition, we observe that, in an optimally run supply chain under MMD, the internal fill rate can be high and the demand variability propagating upstream can be dampened, both different from the system behaviors under stationary demand. The online appendix is available at https://doi.org/10.1287/opre.2017.1615 .
- DOI
- 10.1287/opre.2017.1615
- Volume
- 65 (5)
- Pages
- 1231-1249
- Language
- en
- Export
- BibTeX
- Sources
- crossref