Abstract
This paper considers a queuing system in which a fixed number of identical facilities (servers) are employed one at a time for providing individual customer service at the single service station with unit capacity and each facility undergoes a post-processing after serving its own customer. Customers arrive in a Poisson process, and the customer service time and the facility post-processing time distributions are all exponential. For the queuing system, two different cases, the loss system (finite buffer capacity) and the delay system (infinite buffer capacity), will be analyzed separately to exploit their approximate computation algorithms for the associated long-run system state distributions. The algorithms are then tested for efficiency and effectiveness with various numerical problems.
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.
