Numerical of A Call Centre with Two Types of Queue

Call centre is modelled as a queue system with invisible queue and virtual queue. It forms a special type of structured level dependent matrix. Matrix geometric method is used to find the time independent joint distribution of number of invisible customers and visible customers. Through numerical examples we have given the comparison between the existing call centre queue model and the model that we have proposed.

Computational Performance of a Single Server State Dependent Queue

In this article we consider a single server state dependent queuing system with the service rate varying according to types of customers like normal, tagged and heavy tailed. We develop a state dependent queuing model in which the service rate depends on customer type arrive to the system with quasi-birth-death environment structure and using matrix geometric method we develop the system performance measures. Also, we use these performance measures by utilizing the maximum potential of server and perform sensitivity analysis with numerical illustrations.

Batch Arrival Queueing Model with Unreliable Server

The unreliable server with provision of temporary server in the context of application has been investigated. A temporary server is installed when the primary server is over loaded i.e., a fixed queue length of K-policy customers including the customer with the primary server has been build up. The primary server may breakdown while rendering service to the customers; it is sent for the repair. This type of queuing system has been investigated using Matrix Geometric Method to obtain the probabilities of the system steady state.AMS subject classification number— 60K25, 60K30 and 90B22.

Fluid Queue Driven by anM/M/1Queue Subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption

This paper deals with the stationary analysis of a fluid queue driven by anM/M/1queueing model subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption. The model under consideration can be viewed as a quasi-birth and death process. The governing system of differential difference equations is solved using matrix-geometric method in the Laplacian domain. The resulting solutions are then inverted to obtain an explicit expression for the joint steady state probabilities of the content of the buffer and the state of the background queueing model. Numerical illustrations are added to depict the convergence of the stationary buffer content distribution to one subject to suitable stability conditions.

Computational Analysis of Queues with Catastrophes in a Multiphase Random Environment

A dynamically changing road traffic model which occasionally suffers a disaster (traffic collision, wrecked vehicles, conflicting weather conditions, spilled cargo, and hazardous matter) resulting in loss of all the vehicles (diverted to other routes) has been discussed. Once the system gets repaired, it undergoesn-1trial phases and finally reaches its full capacity phasen. We have obtained the explicit steady state probabilities of the system via Matrix Geometric Method. Probability Generating Function is used to evaluate the time spent by the system in each phase. Various performance measures like mean traffic, average waiting time of vehicles, and fraction of vehicles lost are calculated. Some special cases have also been discussed.

Queues with two units connected in series with a multiserver bulk service with accessible and non accessible batch in unit II

This paper analyses a queueing model consisting of two units I and II connected in series, separated by a finite buffer of size N. Unit I has only one exponential server capable of serving customers one at a time. Unit II consists of c parallel exponential servers and they serve customers in groups according to the bulk service rule. This rule admits each batch served to have not less than ‘a’ and not more than ‘b’ customers such that the arriving customers can enter service station without affecting the service time if the size of the batch being served is less than ‘d’ ( a ≤ d ≤ b ). The steady stateprobability vector of the number of customers waiting and receiving service in unit I and waiting in the buffer is obtained using the modified matrix-geometric method. Numerical results are also presented. AMS Subject Classification number: 60k25 and 65k30

Two-Facility Location Problem with Infinite Retrial Queue

This paper analyzes a two-facility location problem under demand uncertainty. The maximum server for the ith facility is It is assumed that primary service demand arrivals for the ith facility follow a Poisson process. Each customer chooses one of the facilities with a probability which depends on his or her distance to each facility. The service times are assumed to be exponential and there is no vacation or failure in the system. Both facilities are assumed to be substitutable which means that if a facility has no free server, the other facility is used to fulfill the demand. When there is no idle server in both facilities, each arriving primary demand goes into an orbit of unlimited size. The orbiting demands retry to get service following an exponential distribution. In this paper, the authors give a stability condition of the demand satisfying process, and then obtain the steady-state distribution by applying matrix geometric method in order to calculation of some key performance indexes. By considering the fixed cost of opening a facility and the steady state service costs, the best locations for two facilities are derived. The result is illustrated by a numerical example.