Transient analysis of M[X1], M[X2]/G1, G2(a, b)/1 queueing system with Ayyappan G.1, Thamizhselvi P.2 1Department of Mathematics, Pondicherry Engineering College, Puducherry-605 014, India, E-mail: ayyappanpec@hotmail.com 2Department of Mathematics, Pondicherry Engineering College, Puducherry-605 014, India E-mail: tmlselvi972@gmail.com *Corresponding Author: G. Ayyappan, Department of Mathematics, Pondicherry Engineering College, Puducherry-605014, India, E-mail: ayyappanpec@hotmail.com
AMSC: 60K25, 60 K30, 90 B22 Online published on 16 January, 2018. Abstract In this paper, we consider a single server queuing system with two types of batch arrivals and services under non preemptive priority rule. Arrivals follow a compound Poisson process. The server provides single service to the high priority customers and the general bulk service rule for the low priority customers on a FCFS discipline. The server starts service to the low priority customers only if the high priority queue is empty and the number of customers in the low priority queue is greater than or equal to ‘a’. If there are no customer in the high priority queue and the number of customers in the the low priority queue are less than ‘a’ then the server becomes idle. The service time for each service follows a general(arbitrary) distribution. Using the supplementary variable technique, the time dependent probability generating functions of the distributions Pm, n, qm, n and Pm, n+, qm, n+ under equilibrium, have been derived in terms of their Laplace transforms and the corresponding steady state results are also derived. The average number of customers in the queues and the average waiting time are derived. Numerical case has been worked out on the assumption that the service time follows a specified exponential and Erlang-2 distributions. Top Keywords Batch arrival, Bulk service, Non-preemptive priority service, Average queue size. Top |