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.

Full Text
Published version (Free)

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 call