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

DOI10.1287/MNSC.30.6.665MaRDI QIDQ3343734zbMATH OpenOpenAlexFDO

Authors Linda V. Green, Peter J. Kolesar

Publication date 1984

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.30.6.665

zbMATH Keywords

approximationsmultiple car dispatchingmultiple dispatch queueing modelpolice service

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• A Multiple Dispatch Queueing Model of Police Patrol Operations
• The optimal dispatch of Traffic and Patrol Police Service Platforms
• Police patrol policies on motorways with unequal patrol lengths
• Approximating vehicle dispatch probabilities for emergency service systems with location-specific service times and multiple units per location
• Police staffing and workload assignment in law enforcement using multi-server queueing models

Cited in

(7)

• Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments)
• Determining optimal police patrol areas with maximal covering and backup covering location models
• Approximate dynamic programming for the dispatch of military medical evacuation assets
• A Multiple Dispatch Queueing Model of Police Patrol Operations
• Approximate dynamic programming for military medical evacuation dispatching policies
• Police staffing and workload assignment in law enforcement using multi-server queueing models
• Modelling of police recruitment and training with parallel and serial centers

This page was built for publication: A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343734)