Abstract
A nonsymmetric cyclic queueing system is considered in this paper. There are N stations in the system and two queues at each station. A single server visits each station and serves a queue at the station according to the priority rule that is stipulated beforehand. The arrival process at each queue is assumed Poisson, and customers are served according to a general service time distribution. A detailed mathematical analysis for this system proceeds, the equilibrium equations for the probabilities are deduced, and the useful probability-generating functions from this are obtained. The main results of the paper, for example, the mean spending time for customers and the mean queue length, are obtained.
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.
