Technical Note—The Stochastic Queue Median Over a Finite Discrete Set

Rajan Batta
Additional contact information
Rajan Batta: State University of New York at Buffalo, Buffalo, New York

Operations Research, 1989, vol. 37, issue 4, 648-652

Abstract: Many practical location decision problems require facility locations to be restricted to a finite set of points. Quite often such restrictions arise from natural constraints that are specific to the application setting. Motivated by such situations, this paper examines the Stochastic Queue Median (SQM) model of Berman, Larson and Chiu, where potential facility locations are restricted to a finite set of discrete points. An efficient algorithm is presented to solve for the optimal facility location parametrically in the systemwide arrival rate of calls. The complexity of the algorithm and a worst case analysis for the model formulation are also discussed.

Keywords: facilities/equipment; location: facility location over a finite discrete set; queues: optimization in queueing systems (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.4.648 (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:37:y:1989:i:4:p:648-652

Access Statistics for this article

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