Abstract
Abstract We consider the discrete-time G/GI/1 queueing system with multiple exhaustive vacations. By a transform approach, we obtain an expression for the probability generating function of the waiting time of customers in such a system. We then show that the results can be used to assess the performance of G/GI/1 queueing systems with server breakdowns as well as that of the low-priority queue of a preemptive MX+G/GI/1 priority queueing system. By calculating service completion times of low-priority customers, various preemptive breakdown/priority disciplines can be studied, including preemptive resume and preemptive repeat, as well as their combinations. We illustrate our approach with some numerical examples.
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 callMore From: International Journal of Applied Mathematics and Computer Science
Disclaimer: 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.
