IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v30y1984i6p665-670.html
   My bibliography  Save this article

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

Author

Listed:
  • Linda Green

    (Graduate School of Business, Columbia University, New York, New York 10027)

  • Peter Kolesar

    (Graduate School of Business, Columbia University, New York, New York 10027)

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.

Suggested Citation

  • Linda Green & Peter Kolesar, 1984. "A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol," Management Science, INFORMS, vol. 30(6), pages 665-670, June.
  • Handle: RePEc:inm:ormnsc:v:30:y:1984:i:6:p:665-670
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.30.6.665
    Download Restriction: no

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Linda V. Green & Peter J. Kolesar, 2004. "ANNIVERSARY ARTICLE: Improving Emergency Responsiveness with Management Science," Management Science, INFORMS, vol. 50(8), pages 1001-1014, August.
    2. Diwas S. Kc & Christian Terwiesch, 2009. "Impact of Workload on Service Time and Patient Safety: An Econometric Analysis of Hospital Operations," Management Science, INFORMS, vol. 55(9), pages 1486-1498, September.
    3. Rettke, Aaron J. & Robbins, Matthew J. & Lunday, Brian J., 2016. "Approximate dynamic programming for the dispatch of military medical evacuation assets," European Journal of Operational Research, Elsevier, vol. 254(3), pages 824-839.
    4. Hall, Randolph, 2000. "Incident Dispatching, Clearance and Delay," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt2pp689vn, Institute of Transportation Studies, UC Berkeley.
    5. Hall, Randolph W., 2002. "Incident dispatching, clearance and delay," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(1), pages 1-16, January.
    6. Nilay Tan{i}k Argon & Serhan Ziya, 2009. "Priority Assignment Under Imperfect Information on Customer Type Identities," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 674-693, June.
    7. repec:eee:transe:v:103:y:2017:i:c:p:143-157 is not listed on IDEAS
    8. Hall, Randolph W., 2001. "Incident Management: Process Analysis and Improvement," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt1jf6j37t, Institute of Transportation Studies, UC Berkeley.
    9. William P. Millhiser & Charu Sinha & Matthew J. Sobel, 2016. "Optimality of the fastest available server policy," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 237-263, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.