Queueing Theory

1054 Words3 Pages

Introduction to Queueing Theory :

Queueing theory is a branch of Operations Research because the results that we obtained can be used to make business decisions. It is the mathematical study of waiting lines. Queueing theory enables mathematical analysis of several related processes, including arriving at the queue, waiting in the queue and being served at the front of the queue. Using this theory we measure the average waiting time in the queue or the system, the expected number waiting or receiving service and the probability of encountering the system. Queueing system is a model which contains the following structure as the customers arrive and join a queue to wait for the service provided by n servers. After receiving the service, the customer exits the system.

Queueing Theory Equations :

Kendall introduced an A/B/S/K/N/Disc queueing notation that can be used in queueing theory. In A/B/S/K/N/Disc ,A is the inter arrival time distribution, B is the service time distribution, S is the number of servers, K is the system capacity, N is the calling population and Disc is the service discipline assumed.Many times the last three members are omitted, then the notation becomes A/B/S and it is assumed as K = [oo] , N = [oo] and Disc = FIFO.The Queueing Strategies are as follows :

* FIFO(First in First Out) - customers are serviced according to their order of arrival in the queue.

* LIFO(Last in First Out) - the last customer to arrive on the queue is the one who is serviced first.

* PS(Processor Sharing) - customers are serviced equally.

* SIRO (service in random order)- customers are serviced in a random order.

* PR (priority) – customers are serviced based on the p...

... middle of paper ...

...iscussion with doctor.On average: 20 minutes per activity (exponential) and arrival per hour (Poisson) calculate the average number of patients in the waiting room

2.Customers arriving at the post office in 1 queue and more servers arrival intensity 3 per minute (Poisson) service time 60 seconds (exponential) calculate: (I).number of servers which are needed to reach steady state. (ii).probability that there are no customers in the system with the calculated number of servers. (iii) average queue length with the calculated number of servers.

3. In an airport, planes land on a runway . In one runway there are 30 arrivals per hour (Poisson) 90 seconds deterministic landing time .The cost of the fuel $6000,- per hour calculate: – average length of queue. – average time that the plane land in runway. – what is the fuel costs per hour if there is a delay in queue?

Open Document