Equilibrium customer and socially optimal balking strategies in a constant retrial queue with multiple vacations and N-policy

In this paper, equilibrium strategies and optimal balking strategies of customers in a constant retrial queue with multiple vacations and the $N$-policy under two information levels, respectively, are investigated. We assume that there is no waiting area in front of the server and an arriving customer is served immediately if the server is idle; otherwise (the server is either busy or on a vacation) it has to leave the system to join a virtual retrial orbit waiting for retrials according to the FCFS rules. After a service completion, if the system is not empty, the server becomes idle, available for serving the next customer, either a new arrival or a retried customer from the virtual retrial orbit; otherwise (if the system is empty), the server starts a vacation. Upon the completion of a vacation, the server is reactivated only if it finds at least $N$ customers in the virtual orbit; otherwise, the server continues another vacation. We study this model at two levels of information, respectively. For each level of information, we obtain both equilibrium and optimal balking strategies of customers, and make corresponding numerical comparisons. Through Particle Swarm Optimization (PSO) algorithm, we explore the impact of parameters on the equilibrium and social optimal thresholds, and obtain the trend in changes, as a function of system parameters, for the optimal social welfare, which provides guiding significance for social planners. Finally, by comparing the social welfare under two information levels, we find that whether the system information should be disclosed to customers depends on how to maintain the growth of social welfare.