Introduction to the special issue devoted to police deployment. By publishing these four refereed papers together in one issue of Management Science, we have the dual purpose of presenting new substantive research results in an important public sector problem area and of attracting other...

The transactional data of a queueing system are the recorded times of service commencement and service completion for each customer served. With increasing use of computers to aid or even perform service one often has machine readable transactional data, but virtually no information about the...

We consider a multi-priority, N-server, Poisson arrival, nonpreemptive queue, motivated by police applications. The number of servers requested by an arrival has a known priority dependent probability distribution. All servers requested by a customer must start service simultaneously; the...

A simple modification of one equation in Larson (1990) reduces the computational complexity of the algorithm for the Queue Inference Engine (QIE) from O(N⁵) to O(N³), where N is the number of customers queued during a congestion period.

Officers in police patrol cars operate in a complex stochastic environment. In addition to handling dispatcher-assigned calls for service from the public, they patrol to pose a threat of apprehension to would-be offenders and undertake certain on-site interventions to help improve general public...