2019/02/25 by Steven R. Finch, Finch, Steven
Business, Management and Accounting · Computer Science · #41A60 #60G50 (Primary) 05A16 #60K25 #68M20 #90B22 (Secondary) #Advanced Queuing Theory Analysis #Distributed systems and fault tolerance #FOS: Mathematics #History and Overview (math.HO) #Probability (math.PR) #Real-Time Systems Scheduling
paper · pdf · doi:10.48550/arxiv.1902.09272
openalex publication_date 2019/02/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.