Module C7：模块C7.pptVIP

M/G/1 Systems M = Customers arrive according to a Poisson process at an average rate of ? / hr. G = Service times have a general distribution with an average service time = 1/? hours and standard deviation of ? hours (1/? and ? in same units) 1 = one server Cannot get formulas for pn but can get performance measures Example -- Ted’s TV Repair Customers arrive according to a Poisson process once every 2.5 hours -- ? = 1/2.5 = .4/hr. Repair times average 2.25 hours with a standard deviation of 45 minutes ? = 1/2.25 = .4444/hr. ? = 45/60 = .75 hrs. Ted is the only repairman: k= 1 THIS IS AN M/G/1 SYSTEM Performance Measures P0 = 1-?/? = 1-(.4/.4444) = .0991 L = ((??)2 + (?/? )2)/(2(1-?/? )) + ?/? = ((.4)(.75)2 + (.4/.4444)2)/(2(.0991)) + (.4/.4444) = 5.405 Lq = L - ?/? = 5.405 - .901 = 4.504 W = L/ ? = 5.405/.4 = 13.512 hrs. Wq = Lq/ ? = 4.504/.4 = 11.262 hrs. There are no formulas for the pn’s. Select MG1 Worksheet Input ? (in customers/hr.) ? (in customers/hr.) ? (in hours) Performance Measures FINITE QUEUES (M/M/k/F) Frequently there are systems that have limits to the maximum number of customers in the system F Thus with probability pF the system is FULL and an arriving customer cannot join the queue-- i.e. we lose pF portion of the potential customers The effective arrival rate is then ?e = (1 - pF)?? Use ?e to calculate L, Lq, W, and Wq Steady state will always be achieved regardless of ? and? since the queue cannot build up indefinitely!! Example -- Ryan’s Roofing Customer calls average 10/hr. 1 server -- average service time -- 3 minutes ? = 60/3 = 20/hr. 3 lines so 2 can be on hold -- they will hold until they are served Arriving phone call when all 3 lines busy will not join the system Select MMkF Worksheet Input ?, ?, k, F Performance Measures pn’s ?e = (1-.06667)(10) = 9.33333 W = L/ ?e M/M/1 QUEUES WITH FINITE CALLING POPULATIONS (M/M/1//m) Maximum m school buses at repair facility, or m assigned customers to a salesman, etc. 1/?