Discuss the basic components of any queueing system, Operation Research

Assignment Help:

Question:

(a) Discuss briefly the four basic components of any queueing system.

(b) Explain what you understand by the following models:

(i) (M| M | 1 : N | FCFS)

(ii) (M| M | S : ∞| SIRO)

(iii) (M| Ek | 1 : ∞ | FCFS)

(c) A supermarket has two ladies at the sales counters. Given that the service for each customer is exponential with mean 6 minutes and customers arrive in a Poisson fashion at the counter at the rate of 15 per hour, Determine

(i) the expected percentage of idle time for each lady at the sales counter.

(ii) The probability of having to wait for service.


Related Discussions:- Discuss the basic components of any queueing system

How to solve operation research optimization questions, how to solve operat...

how to solve operation research optimization questions

Markov chain models - operation research model, These models are used for a...

These models are used for analyzing a system which changes over a period of time among various possible outcomes or states. The models while dealing with such systems describe tra

Maths, Solve the following Linear Programming Problem using Simple method. ...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2, Subject to the constraints: X1+ X2 = 4 X1+ X2 = 2 X1, X2 = 0

Problem, A paper mill produces two grades of paper viz., X and Y. Because o...

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

process technolgy, 1 strategic implication of product and process decision...

1 strategic implication of product and process decisions 2 process planning and design 3 work measurement

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

Linear Programing, 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

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