Abstract
We consider a queueing system with c servers and a threshold type vacation policy. In this system, when a certain number d < c of servers become idle at a service completion instant, these d servers will take a synchronous vacation of random length together. After each vacation, the number of customers in the system is checked. If that number is N or more, these d servers will resume serving the queue; otherwise, they will take another vacation together. Using the matrix analytical method, we obtain the stationary distribution of queue length and prove the conditional stochastic decomposition properties. Through numerical examples, we discuss the performance evaluation and optimization issues in such a vacation system with this ( d, N) threshold policy.
Sign-in/Register to access full text options 
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.
