Answers are grounded in this paper and cite their sources.
In this paper, we analyse a queueing system where the server may take a vacation. The customers arrive at the service facility according to a Poisson process, and are served if the server is available (not on vacation). We consider two models: when the server vacation cycle is independent of and dependent on the number of customers in the system. The infinitesimal generators of the underlying Markov processes have a block tri-diagonal structure, and we provide a matrix geometric solution. When the vacation cycle is independent of the customer queue length, we present a simple load-dependent approximation that is fairly accurate.
No takes yet. Share an insight, caveat, or question.
B. Vinod (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: