Abstract
A closed exponential tandem queue in which every customer has to be served by two servers is considered. Given the numbers of customers lined up at each of the two servers, we derive the probability distributions of the waiting time of any customer until his second service is completed, and of the total busy time of the system.
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.
