Abstract
The author studies an M/G/1 queueing system with multiple vacations. The server is turned off in accordance with the K‐limited discipline, and is turned on in accordance with the T‐N‐hybrid policy. This is to say that the server will begin a vacation from the system if either the queue is empty or K customers were served during a busy period. The server idles until it finds at least N waiting units upon return from a vacation.Formulas for the distribution generating function and some characteristics of the queueing process are derived. An optimization problem is discussed.
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.
