Year-end Sale % OFF 
Abstract
This paper considers a non-Markovian priority retrial queue which serves two types of customers. Customers in the regular queue have priority over the customers in the orbit. This means that the customer in orbit can only start retrying when the regular queue becomes empty. If another customer arrives during a retrial time, this customer is served and the retrial has to start over when the regular queue becomes empty again. In this study, a particular interest is devoted to the stochastic monotonicity approach based on the general theory of stochastic orders. Particularly, we derive insensitive bounds for the stationary joint distribution of the embedded Markov chain of the considered system.
Published Version
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.
