Abstract
In this paper we consider a discrete-time cyclic-service system consisting of multiple stations visited by a single server. Several priority classes of customers arrive at each station according to independent batch Bernoulli processes. The head-of-the-line (HL) priority rule and non-zero switch-over times between stations are assumed. The customers are served at each station under a mixed (exhaustive, gated, and 1-limited) service strategy. We obtain an exact expression for a weighted sum of the mean waiting times for the individual priority classes, a so-called pseudo-conservation law. A continuous-time result is derived as a special case of our model.
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.
