You are not currently logged in.
Access JSTOR through your library or other institution:
A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol
Linda Green and Peter Kolesar
Vol. 30, No. 6 (Jun., 1984), pp. 665-670
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2631746
Page Count: 6
You can always find the topics here!Topics: Approximation, Police, Modeling, Underestimates, Graduate schools, Parametric models, Network servers, Emergency services, Emergency management, Dispatching
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
In many cities, a substantial fraction of calls for police service require more than one patrol car. We 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.
Management Science © 1984 INFORMS