Abstract
In this paper, we investigate the M/M/1 retrial queue with working vacations and a constant retrial rate. In the queue, customers decide about the entry based on the information upon their arrival instants. Scenarios regarding the availability of information (i.e., the server is occupied or not, and the server is on the vacation or not) for customers are compared. We derive the closed form solution for the stationary probabilities of the queue. Social optimizing and Nash equilibrium strategies for joining the system are investigated. Based on numerical results, the social benefit rate is best when customers know all information about the server.
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.
