A Queueing-Linear Programming Approach to Scheduling Police Patrol Cars.

摘要

In recent years, a good deal of effort has been devoted to the development and application of quantitative methods to assist police departments in making resource allocation and manpower scheduling decisions. This paper can be viewed as part of this general effort. It presents a methodology for creating new patrol car schedules that improve the correspondence between patrol car availability and demands for service. The approach is currently being tested for use by the New York City Police Department.