Regulated random walks and the LCFS backlog probability: Analysis and application
成果类型：
Article
署名作者：
Baron, Opher
署名单位：
University of Toronto
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1070.0442
发表日期：
2008
页码：
471-486
关键词：
摘要：
Random walks have been used extensively within operations research models such as inventory systems and single-server queues to estimate performance measures. In this paper, we use sample-path analysis to express the steady-state probability of a one-sided regulated random walk to increase and be above a threshold, referred to as the last-come-first-serve (LCFS) backlog probability. We approximate the LCFS backlog probability under mild assumptions on the distribution of the random walk's steps and provide its exact expression when the steps are exponentially distributed, and a closed-form approximation when the steps are normally distributed. In our numerical experiments, the average relative gap between the approximated LCFS backlog probabilities and their simulated values is 5.13%. We further show that the LCFS backlog probability is an upper bound on the loss probability-the probability that a two-sided regulated random walk is at a boundary. This bound is tighter than the backlog probability-the probability that a random walk ever crosses a threshold that also bounds the loss probability. In an inventory application, we demonstrate that using the LCFS backlog probability rather than the backlog probability reduces the inventory level required to satisfy a service-level constraint on the percentage of orders backlogged. In our examples, this reduction leads to cost savings of 31% on average.