Operations Research · 1985 · 629 citations · 24 references
BusinessMathematicsQueuing TheoryStochastic ModelingStochastic ProcessesQueue ManagementQueueing AnalysisQueueing ProcessesQueueing SystemsQueueing TheoryStochastic Service SystemsM/g/1 QueuesQueueing ModelsServer Vacation ModelsVacation ModelsVacation Queue ModelsVacation Queueing ModelsVacation Queues
This paper studies M/G/1 queueing systems with server vacations, noting that for several specific models the stationary customer count can be decomposed into independent components, one being the standard M/G/1 count. The authors aim to prove that such a decomposition holds for a broad class of M/G/1 queueing models. They employ direct and intuitive arguments to establish the decomposition. They also derive two new results that enable significant simplifications in solving complex M/G/1 queueing models.
This paper considers a class of M/G/1 queueing models with a server who is unavailable for occasional intervals of time. As has been noted by other researchers, for several specific models of this type, the stationary number of customers present in the system at a random point in time is distributed as the sum of two or more independent random variables, one of which is the stationary number of customers present in the standard M/G/1 queue (i.e., the server is always available) at a random point in time. In this paper we demonstrate that this type of decomposition holds, in fact, for a very general class of M/G/1 queueing models. The arguments employed are both direct and intuitive. In the course of this work, moreover, we obtain two new results that can lead to remarkable simplifications when solving complex M/G/1 queueing models.
24
Poisson Arrivals See Time Averages
Ronald W. Wolff · Operations Research · 1982 · 1.2K citations
An introduction to queueing theory
Computers & Operations Research · 1993 · 914 citations