Operations Research · 1975 · 369 citations · 10 references
BusinessEmergency PlanningDisaster ResponseEmergency ManagementQueuing TheoryQueue ManagementQueueing AnalysisQueueing NetworksQueueing ProcessesQueueing SystemsQueueing TheoryApproximate EstimatingQueue Network ModelsQueueing Network DesignQueueing Network SimulationQueueing-based Capacity AnalysisQueuesQueuing Network AnalysisSimulation Of Queueing Systems
This paper presents an approximate procedure for computing selected performance characteristics of an urban emergency service system. Based on a recently developed hypercube queuing model, the procedure requires for N servers solution of only N simultaneous equations, rather than 2 N as in the exact model. The procedure relies on the theory of M/M/N queues in which servers are selected randomly and without replacement until the first available (free) server is found. The underlying model is intended for analyzing problems of vehicle location and response district design in urban emergency services, includes interdistrict as well as intradistrict responses, and allows computation of several point-specific as well as area-specific performance measures.
10
The Location of Emergency Service Facilities
Constantine Toregas, Ralph W. Swain, Charles ReVelle et al. · Operations Research · 1971 · 1.8K citations
Nonpartisan Political Redistricting by Computer
Sidney W. Hess, James B. Weaver, H. J. Siegfeldt et al. · Operations Research · 1965 · 293 citations