Technical Note—A Dominance Theorem for the Stochastic Queue Median Problem

Samuel S. Chiu
Additional contact information
Samuel S. Chiu: Stanford University, Stanford, California

Operations Research, 1986, vol. 34, issue 6, 942-944

Abstract: In this note we prove a dominance property of the set of Hakimi medians for the Stochastic Queue Median (SQM) problem on a network. The SQM minimizes the average response time of a mobile server to a random request for service which occurs in accordance with independent Poisson processes from nodes of a network. We constructively find two strictly positive ranges of the Poisson arrival rate over which a subset of the Hakimi medians will dominate all other locations on the network. These ranges are at the extremes of the arrival rates in which the SQM problem is feasible. Specifically, these intervals are server utilization ranges covering zero and one, respectively.

Keywords: 185 location with queueing delay as objective; 488 stochastic problem on network; 696 optimization involving queueing delay (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.6.942 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:34:y:1986:i:6:p:942-944

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().