FINITE CAPACITY QUEUEING SYSTEM WITH VACATIONS AND SERVER BREAKDOWNS

Abstract This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate ν if the system is empty. Also, the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate λ during vacation, faster rate λ during active service and slower rate λ≥0 during the breakdown. Customers are served exponentially with the rate µ . Server breakdowns at rate b and it is immediately repaired exponentially with the rate r . We derive the explicit formulas for queue length distribution, average queue length, average number of customers in the system and average waiting time for a customer in queue, and in the system. Numerical illustrations have been cited to show that the proposed model is practically sound.