Abstract
This paper examines the properties of single server queueing systems with customers of several types, where the server rotates its effort among the customer classes and serves all the customers that have accumulated for each class before moving on to the next. The paper shows that expressions for the first two moments of the queue lengths, and for the mean waiting times, can be developed from two simple properties of the arrival and service processes. The properties, which include existing models as special cases, seem plausible descriptors of the complex arrival and service processes that arise in the transportation field.
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.
