Abstract
We consider a finite capacity single server queue in which the customers arrive according to a Markovian arrival process. The customers are served in batches following a ‘general bulk service rule’. The service times, which depend on the size of the batch, are generally distributed. We obtain, in steady-state, the joint distribution of the random variables of interest at various epochs. Efficient computational procedures in the case of phase type services are presented. An illustrative numerical example to bring out the qualitative nature of the model is presented.
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.
