Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

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

12 references·7 citing·34 second hop

FromToDepth

this work references cited by second hop

References

1977Fundamentals of Queueing Theory.2,930 cited
1974A hypercube queuing model for facility location and redistricting in urban emergency services652 cited
1985Fundamentals of queueing theory (2nd ed.).603 cited
1978Queueing Systems, Volume 2: Computer Applications.550 cited
1954Priority Assignment in Waiting Line Problems417 cited
1976Queueing Systems. Volume 1: Theory (Leonard Kleinrock)306 cited
1972Methods for Allocating Urban Emergency Units: A Survey132 cited
1975A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars129 cited
1984A Multiple Dispatch Queueing Model of Police Patrol Operations98 cited
1978A Patrol Car Allocation Model: Capabilities and Algorithms82 cited
1978A Patrol Car Allocation Model: Background81 cited
1981Multiple Unit Dispatches in Emergency Services: Models to Estimate System Performance79 cited

Cited by

1994Chapter 6 The deployment of police, fire, and emergency medical units49 cited
2016Approximate dynamic programming for the dispatch of military medical evacuation assets42 cited
1984The Feasibility of One-Officer Patrol in New York City

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

41 cited

1989An N Server Cutoff Priority Queue Where Arriving Customers Request a Random Number of Servers23 cited

1999A sample path analysis of the M t /M t /c queue21 cited

2010An Operational Mechanism Design for Fleet Management Coordination in Humanitarian Operations20 cited

1991Stationary Waiting Time Distribution of a Queue in Which Customers Require a Random Number of Servers13 cited