compute probabilities-transitions and transition rate, Operation Research

Assignment Help:

Consider a queueing system with 1 counter, to which groups of customers arrive according to a Poisson proces with intensity l. The size of a group is 1 with probability p and 2 with probability 1-p. Customers are served one by one. The service time has exponential distribution with mean m-1 . Service times are mutually independent and independent of the arrival proces. The system may contain at most 3 customers. If the system is full upon arrival of a group, or if the system may contain only one additional customer upon arrival of a group of size 2, then all customers in the group are lost and will never return. Let Z(t) record the number of customers at time t.

(a)    Explain why {Z(t), t³0}is a Markov proces and give the diagram of transitions and transition rates.

(b)   Give the equilibrium equations (balance equations) for the stationary probabilities Pn , n=0,1,2,3.

(c)    Compute these probabilities Pn , n=0,1,2,3.

The answers to the following questions may be provided in terms of the probabilities Pn  (except for (h)).

(d)   Give an expression for the average number of waiting customers.

(e)   Give the departure rate and the rate at which customers enter the queue.

(f)    Give an expression for the average waiting time of a customer.

(g)   What is the fraction of time the counter is busy?

(h)   What is the average length of an idle period?

(i)    Determine from  (g) and (h) the average length of a period the system is occupied (= at least 1 customer in the system).

(j)    What is the rate at which groups of size 2 enter the queue?


Related Discussions:- compute probabilities-transitions and transition rate

Sequensing problem, job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10...

job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10 6 12 1 3

Method of calculation of mode - measure of central tendency , Method of cal...

Method of calculation of Mode Calculation  of Mode  Individual  series: For determining  mode count the  number of times the  various  values  repeat  themselves and the  va

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Operation Research Models, Explain the classification of models 1. Classifi...

Explain the classification of models 1. Classification by function or uses 2. Classification by degree of qualification 3. Classification by physical characteristics 4. Classidicat

Or, .A paper mill produces two grades of paper viz., X and Y. Because of ra...

.A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper

Duality, Write a note on economic interpretation of dual?

Write a note on economic interpretation of dual?

Linear programing, Solve the following Linear Programming Problem using Sim...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2

Operation research, A paper mill produces two grades of paper viz., X and Y...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Simple random sampling - sampling decisions, Simple Random Sampling  ...

Simple Random Sampling  This  is  simplest  and most  popular  technique  of sampling. In it each  unit  of the  population has equal  chance  of being  included in the samp

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd