Abstract
We consider an M/M/cqueueing system with impatient customers and a synchronous vacation policy, where customer impatience is due to the servers’ vacation. Whenever a system becomes empty, all the servers take a vacation. If the system is still empty, when the vacation ends, all the servers take another vacation; otherwise, they return to serve the queue. We develop the balance equations for the steady-state probabilities and solve the equations by using the probability generating function method. We obtain explicit expressions of some important performance measures by means of the two indexes. Based on these, we obtain some results about limiting behavior for some performance measures. We derive closed-form expressions of some important performance measures for two special cases. Finally, some numerical results are also presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
