Abstract
AbstractWe consider in this paper the queueing system in which the input is in batches of variable numbers following a Poisson distribution; queue discipline is “first come first served,” it being assumed that the batches are preordered for service purposes; and service time distribution is hyperexponential with n branches. The Laplace transform of the system size distribution is determined by applying the method of generating functions, devised by Bailey [1] . Some of the known results are derived as particular cases.
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.
