A single‐server priority queueing‐location model

Rajan Batta · Richard Charles Larson · Amedeo R. Odoni

37 citations0/0 files storedNetworks

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Advanced Queuing Theory Analysis Optimization and Search Problems

Abstract

Abstract This paper considers the problem of locating a single server on a network, relaxing the assumption that the server is always available for service, and explicitly accounting for queueing. The resulting queueing‐location model allows for an arbitrary number of priority classes. Properties of the objective function are developed and algorithms presented for obtaining the optimal location on tree and cyclic networks. Sensitivity analysis with respect to the average arrival rate of calls is investigated. A numerical example is presented to illustrate the results of this paper. The major conclusions of the paper include: (a) the optimal location need not be at a node of the network, (b) the optimal location changes as a function of the arrival rate of calls into the system, (c) the optimal location is usually different from that obtained by grouping all calls into one priority class.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 37 citations exist upstream.

References

1964Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph 1974A hypercube queuing model for facility location and redistricting in urban emergency services 1985Optimal Server Location on a Network Operating as an M/G/1 Queue 1969Optimal Locations for Centers in a Network 1985Optimal 2-Facility Network Districting in the Presence of Queuing 1985Locating a Mobile Server Queueing Facility on a Tree Network

Cited by

2003Location of Multiple-Server Congestible Facilities for Maximizing Expected Demand, when Services are Non-Essential 1989A location model for a facility operating as an M/G/k queue 2016A stochastic mathematical model to locate field hospitals under disruption uncertainty for large-scale disaster preparedness 1988Single Server Queueing-Location Models with Rejection 2004New Trends in Public Facility Location Modeling 2008Optimal location of multi-server congestible facilities operating as M/Er/m/N queues 2011Location of Multiple-Server Common Service Centers or Facilities, for Minimizing General Congestion and Travel Cost Functions

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.