Abstract
A multiqueue system with a cyclic server and a class of limited service policies is discussed. In particular, exhaustive limited (EL), gated limited, and general decrementing service policies are investigated. The derivations of the expected amount of work left in the queue at the server departures for these three policies are given. These results are all in terms of unknown boundary probabilities. Corresponding server vacation models are used to estimate these unknown probabilities. Pseudoconservation laws for these policies are subsequently obtained. Numerical results obtained for the EL policy are noted to be very accurate compared with simulation results. Conservation laws with mixed service policies, and exact expressions of mean waiting times in symmetric systems are given. >
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.
