SINGLE SERVER RETRIAL QUEUEING MODELS OF MULTIPLE VACATION’S WITH ENCOURAGED CUSTOMERS

The single server queueing model of finite size with repeated vacations and promoted customers arrival is examined in this work. By employing the recursive approach, the steady-state solution is achieved. When the server is idle, or the system is empty, the server takes a vacation. He will resume regular work once his vacation is over if he discovers any customers waiting for service; if not, he will take another vacation and so on. By using a recursive method, some of the system's operational characteristics, such as the predicted queue length, sojourn time, and probability of various server statuses, are determined. When businesses provide attractive off-season sales or holiday season discounts, the number of consumers suddenly jumps, giving birth to the term encouraged customers.