A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol
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.
Volume (Year): 30 (1984)
Issue (Month): 6 (June)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:6:p:665-670. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.