Abstract
This paper studies a single server finite-buffer bulk-service queue in which the inter-arrival and service times are exponentially and arbitrarily distributed, respectively. The service is performed in batches of maximum size ‘ b’ and minimum size ‘ a’. Server takes a single vacation when he finds less than ‘ a’ customers after the service completion. The distributions of the number of customers in the queue at arbitrary, service completion and vacation termination epochs have been obtained. Finally, some key performance measures such as average queue length, probability of blocking etc. are 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.
