Chapter 5:  
Spatially Distributed Queues
CONTENTS
Chapter 1
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Chapter 8
5 Spatially Distributed Queues
5.1 Server-to-Customer Systems
5.2 Using theM/G/1 Model
5.3 Two-Unit Model (Zero Line Capacity)
5.3.1 Restrictions on service time and queueing behavior
5.3.2 General Model
5.3.3 Nonhomogenous rectangular city example
5.3.4 Optimal partitioning
5.3.5 Facility location
5.4 Hypercube Queueing Model
5.4.1 Some uses of the model
5.4.2 Model assumptions
5.4.3 Three-server example (infinite line capacity)
5.4.4 System performance measures (infinite line capacity)
5.4.5 Extensions to the basic hypercube model
5.5 Hypercube Approximation Procedure (Infinite Line Capacity)
5.5.1 Correction factor
5.5.2 Workload estimation
5.5.3 Return to the three-server example
5.6 Fraction of Dispatches That Are Interresponse Area Dispatches
5.7 Spatial Distribution of Busy Servers
5.8 Expected Travel Distances and Expected Travel Times, Revisited
5.8.1 Extensions and empirical evidence
*** References
*** Problems