Transient Solution of an M=M=1 Variant Working Vacation Queue with Balking

This paper presents the transient solution of a variant working vacation queue with balking. Customers arrive according to a Poisson process and decide to join the queue with probability b or balk with b = 1 􀀀 b. As soon as the system becomes empty, the server takes working vacation. The service times during regular busy period and working vacation period, and vacation times are assumed to be exponentially distributed and are mutually independent. We have obtained the transient-state probabilities in terms of modied Bessel function of the rst kind by employing probability generating function, continued fractions and Laplace transform. In addition, we have also obtained some other performance measures.