Single Server Queueing-Location Models with Rejection

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

Transportation Science, 1988, vol. 22, issue 3, 209-216

Abstract: This paper considers the problem of locating a single server on a network while explicitly accounting for queueing of calls for service. Calls from a node can either all be accepted or all be rejected by the service system. Two models are considered. In the first model a call can be rejected independent of the state of the system when the call arrives. In the second model, an arriving call can be rejected only if it finds the server busy. The queueing systems are analyzed for both models. A greedy heuristic is developed which, parametrically in the arrival rate of calls, determines the location of the server and the rejection strategies at nodes. Extreme case analysis with respect to the arrival rate is investigated. A numerical example illustrates our results. Our major observation is that the rejection strategies for calls are dependent on the arrival rate, and the choice of model.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.3.209 (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:ortrsc:v:22:y:1988:i:3:p:209-216

Access Statistics for this article

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