Abstract

We consider an M/M/1 queueing system with vacations and impatient customers. Whenever a customer arrives at the system, it activates an random ``impatience timer. If the customer's service has not been completed before the customer's impatience timer expires, the customer abandons the queue, and never returns. It is assumed that the impatience timer depends on the server's states. We analyze both multiple and single vacation scenarios and derive the probability generating functions of the number of customers in the system when the server is in vacation period and busy period. Then, we obtain explicit expressions for various performance measures such as the mean system sizes when the server is either on vacation or busy, the proportion of customers served, and the average rate of abandonments due to impatience. We present some numerical results for multiple vacation scenario to show the effects of the parameters of impatience timers on some performance measures. Finally, we show some inequalities on some performances under the single vacation policy and under multiple vacation policy.

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