A note on a stochastic location problem
May 1993
Article
volume 13, issue 4 pp 213-214.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(A_Note_on_a_Stochastic_Problem.pdf, 0.1MB) |
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.
Keywords
Automatically Extracted Terms
- customer
- location
- process
- model
- result
- death processes
- arrival
- state
- facility
- number
- monotonicity result
- k-sflm location problem
- system
- service
- server
- problem
- time t
- service facility
- research
- queueing process
