
Time Dependent Probabilities of / /1 Queue with Working Vacation Subject to Disasters and Repair
Author(s) -
B. Janani,
M. Geetha Priya
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.k2477.0981119
Subject(s) - computer science , state (computer science) , queue , queueing system , queueing theory , service (business) , nobody , markov process , function (biology) , real time computing , operations research , computer network , operating system , mathematics , business , algorithm , statistics , marketing , evolutionary biology , biology
A single server Markovian queueing model with working vacation subject to disaster and repair is considered. Whenever the server finds nobody in the system, the server is allowed to take a working vacation where, the server provides service at a slower rate than usual. Also disaster can occur either during busy state or during working vacation state. Whenever the system met with disaster all customers are flushed out and the system transits to repair state. Customers are allowed to join the queue even during repair time. After repair, if the server finds customer then the server moves to busy state otherwise the server moves to working vacation state. Using generating function and Laplace transform techniques explicit time dependent probabilities for various states have been obtained.