Year: 2019
Type: preprint
Abstract: In discrete time, customers arrive at random. Each waits until one of three servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. Algebraic expressions obtained for the two-server scenario do not appear feasible here. We also review well-known distributional results for maximum wait time associated with an M/M/1 queue and speculate about their generalization.
Source: arXiv (Cornell University)
Author: Finch, Steven
Language: English
Subfield: Management Information Systems
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W2950838968