Abstract
We consider multi-class priority queues with nonpreemptive services controlled by an exponential timer and multiple vacations. By reducing this model to the priority model with Bernoulli schedule analyzed by Katayama (1997), we obtain the Laplace–Stieltjes transform for the sojourn time in the system for each priority class, assuming (i) constant service times or (ii) general service times with either 1-limited or exhaustive service, and provide recursive equations to evaluate its first two moments.
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.
