Abstract
Calls from a node can either all be accepted or all be rejected by the service system. Two models are considered: a call can be rejected independently of the state of the system when the call arrives; 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. Our major observation is that the rejection strategies for calls are dependent on the arrival rate and the choice of model.
| Original language | English |
|---|---|
| Pages (from-to) | 209-216 |
| Number of pages | 8 |
| Journal | Transportation Science |
| Volume | 22 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1988 |
Fingerprint
Dive into the research topics of 'SINGLE SERVER QUEUEING-LOCATION MODELS WITH REJECTION.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver