Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Frontiers in queueing
Analysis of an M/G/1 queue with constant repeated attempts and server vacations
Computers and Operations Research
Computers and Operations Research
A modified vacation model M[x]/G/1 system: Research Articles
Applied Stochastic Models in Business and Industry
Accessible bibliography on retrial queues
Mathematical and Computer Modelling: An International Journal
On the Mx/G /1 queue with vacation time
Operations Research Letters
Steady state analysis of the GI/M/1/N queue with a variant of multiple working vacations
Computers and Industrial Engineering
Hi-index | 7.29 |
This paper considers a batch arrival retrial queue with general retrial times under a modified vacation policy. Any arriving batch finding the server busy or on vacation enters an orbit. Otherwise, one customer from the arriving batch obtains the service immediately while the rest join the orbit. If the orbit is empty, the server takes at most J vacations repeatedly until at least one customer appears in the orbit upon returning from a vacation. If the orbit is nonempty when the server returns from a vacation, the server waits idly for customers from the orbit or new arrivals. On the other hand, if no customers are recorded in the orbit at the end of the Jth vacation, the server waits for new customers to arrive. This retrial system has potential applications in packet-switched networks. By applying the supplementary variable technique, some important system characteristics are derived. The results presented in the paper may be useful for network system designers and software system engineers.