Locating an n-server facility in a stochastic environment
Computers and Operations Research
Stochastic modelling and analysis: a computational approach
Stochastic modelling and analysis: a computational approach
Hi-index | 0.00 |
In this note we give a short and easy proof of the equivalence of Hakimi's one-median problem and the k-server-facility-loss median problem as discussed by Chiu and Larson in Computer and Operation Research. The proof makes only use of a stochastic monotonicity result for birth and death processes and the insensitivity of the M/G/k/k loss model.