2000 character limit reached
Geo/Geo/2 Queues and the Poisson Clumping Heuristic
Published 25 Feb 2019 in math.HO and math.PR | (1902.09272v1)
Abstract: In discrete time, customers arrive at random. Each waits until one of two servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. In the context of an emergency room (for medical treatment), the virtue of one fast doctor over two slow doctors is explored. Via limiting argument to continuous time, we study likewise the M/M/2 queue.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.