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

Methodology of operation research, The systematic methodology developed f...

The systematic methodology developed for an operation research study with problems involving conflicting multiple objective policies and alternatives. Operation research in

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

. 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

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z

Research process and methodology , Case Study - Research Process Tomz...

Case Study - Research Process Tomzak  and Hale  inc was a medium sized  marketing  research firm  located  in a large mind western  city. Bob Lynn a marketing  vice president

Closed lood, give the procedure of tracing a closed loop

give the procedure of tracing a closed loop

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

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

.sequencing problem, which job should proceed first among the 2 jobs on n ...

which job should proceed first among the 2 jobs on n machines by graphical method

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