Abstract
In many cities, a substantial fraction of calls for police service require more than one patrol car. The authors compare Green's multiple dispatch queueing model to several M/M/c-based approximations for multiple car dispatching that are obtained by adjusting the parameters. We found that none of the approximate models yields consistently reliable results under a broad range of conditions. The best approximations are produced by reducing the actual number of servers. Increasing the call rate gives the worst results.
| Original language | English |
|---|---|
| Pages (from-to) | 665-670 |
| Number of pages | 6 |
| Journal | Management Science |
| Volume | 30 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 1984 |
ASJC Scopus Subject Areas
- Strategy and Management
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'COMPARISON OF THE MULTIPLE DISPATCH AND M/M/c PRIORITY QUEUEING MODELS OF POLICE PATROL.'. Together they form a unique fingerprint.Cite this
Green, L., & Kolesar, P. (1984). COMPARISON OF THE MULTIPLE DISPATCH AND M/M/c PRIORITY QUEUEING MODELS OF POLICE PATROL. Management Science, 30(6), 665-670. https://doi.org/10.1287/mnsc.30.6.665