Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Exponential two server queue with N-policy and general vacations
Queueing Systems: Theory and Applications
Analysis on queueing systems with synchronous vacations of partial servers
Performance Evaluation
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Analysis of a Multiserver Queue with Setup Times
Queueing Systems: Theory and Applications
Analysis of customers' impatience in queues with server vacations
Queueing Systems: Theory and Applications
Analysis of multi-server queue with a single vacation (e, d)-policy
Performance Evaluation
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Heavy-traffic limits for many-server queues with service interruptions
Queueing Systems: Theory and Applications
Service Interruptions in Large-Scale Service Systems
Management Science
Numerical investigation of finite-source multiserver systems with different vacation policies
Journal of Computational and Applied Mathematics
Analysis of multi-server queue with synchronous vacations and gated discipline
Proceedings of the 6th International Conference on Queueing Theory and Network Applications
An algorithmic analysis of multi-server vacation model with service interruptions
Computers and Industrial Engineering
Multi-server machine repair model with standbys and synchronous multiple vacation
Computers and Industrial Engineering
Stochastic inequalities for M/G/1 retrial queues with vacations and constant retrial policy
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
We study a multi-server M/M/c type queue with a single vacation policy for some idle servers. In this queueing system, if at a service completion instant, any d (d ⩽c) servers become idle, these d servers will take one and only one vacation together. During the vacation of d servers, the other c−d servers do not take vacation even if they are idle. Using a quasi-birth-and-death process and the matrix analytic method, we obtain the stationary distribution of the system. Conditional stochastic decomposition properties have been established for the waiting time and the queue length given that all servers are busy.