Stochastic ordering conjecture for needy patients in Erlang-R and closed ward models
Stochastic ordering conjecture for needy patients in Erlang-R and closed ward models
Let , and denote the stationary numbers of needy patients in the Erlang-R models with blocking and holding and in the closed ward model, respectively. For random variables, write when is stochastically dominated by . Stochastic ordering conjecture.
The ordering is motivated by simulation results under the scaling considered in the paper and was observed across a multitude of parameter settings for . It compares the stationary needy-patient populations of the blocking, holding and closed ward models; no proof or resolution is supplied here.
Sources & referencesView supporting material
Primary source
Johan S. H. van Leeuwaarden, Britt W. J. Mathijsen, Fiona Sloothaak and Galit B. Yom-Tov, “The restricted Erlang-R Queue: Finite-size effects in service systems with returning customers”, arXiv:1612.07088 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.