Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Optimal two-threshold policies in an M/G/1 queue with two vacation types
Performance Evaluation
The Discrete-Time GI/Geo/1 Queue with Multiple Vacations
Queueing Systems: Theory and Applications
Discrete-time GI/Geo/1 queue with multiple working vacations
Queueing Systems: Theory and Applications
Discrete-time GeoX/G/1 queue with unreliable server and multiple adaptive delayed vacations
Journal of Computational and Applied Mathematics
The variant vacation policy Geo/G/1 queue with server breakdowns
Proceedings of the 5th International Conference on Queueing Theory and Network Applications
Steady state analysis of the GI/M/1/N queue with a variant of multiple working vacations
Computers and Industrial Engineering
Discrete-time GeoX/G(a,b)/1/N queues with single and multiple vacations
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
This paper treats the discrete time Geometric/G/1 system with vacations. In this system, after serving all customers in the system, the server will take a random maximum number of vacations before returning to the service mode. The stochastic decomposition property of steady-state queue length and waiting time has been proven. The busy period, vacation mode period, and service mode period distributions are also derived. Several common vacation policies are special cases of the vacation policy presented in this study.