Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol

Linda Green and Peter Kolesar
Management Science
Vol. 30, No. 6 (Jun., 1984), pp. 665-670
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2631746
Page Count: 6
  • Download ($30.00)
  • Cite this Item
A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
665
    665
  • Thumbnail: Page 
666
    666
  • Thumbnail: Page 
667
    667
  • Thumbnail: Page 
668
    668
  • Thumbnail: Page 
669
    669
  • Thumbnail: Page 
670
    670