A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol
比较了Green的多重派遣排队模型与几种基于M/M/c的近似模型在警察多车派遣中的表现，发现没有一种近似模型能在广泛条件下始终可靠，减少服务器数量的近似效果最好，而增加呼叫率的效果最差。
In many cities, a substantial fraction of calls for police service require more than one patrol car. We compare Green's multiple dispatch queueing model to several M/M/c-based approximations for multiple car dispatching that are obtained by adjusting the parameters. We found that none of the approximate models yields consistently reliable results under a broad range of conditions. The best approximations are produced by reducing the actual number of servers. Increasing the call rate gives the worst results.