財務(wù)管理與財務(wù)分析運營管理課件c-資料下載頁
【導(dǎo)讀】WaitingLines. SupplementC. Queueiseverywhere. management. Visiblequeue. Invisiblequeue:. –telephone,dialintoInter,Fudanmailbox,…WaitingLine. Examples. office. intersect.passage. Queuingsystem. Segmentcustomers. Queuingsystem. WaitingLines. service.groupofmachines),orboth,necessarytoperform. WaitingLineModels. BasicElements. Servicesystem. Customer. population. Waitingline. Priority. rule. Service. facilities. Served. customers. WaitingLine. Arrangements. Singleline. Servicefacilities. Multiplelines. Servicefacilities. ServiceFacility. Arrangements. ServiceFacility. Arrangements. Singlechannel,singlephase. Service. facility. Singlechannel,multiplephase. ServiceFacility. Arrangements. Service. facility1. Service. facility2. Multiplechannel,singlephase. ServiceFacility. Arrangements. Service. facility1. Service. facility2. Multiplechannel,multiplephase. ServiceFacility. Arrangements. Service. facility3. Service. facility4. Service. facility1. Service. facility2. Service. facility3. Service. facility4. Service. facility1. Service. facility2. Routingfor:1–2–4. Routingfor:2–4–3. Routingfor:3–2–1–4. ServiceFacility. Arrangements. MixedArrangement. PriorityRule. servenext.processingtime(SPT)
【正文】 ??????????????????????????????????????????????????????????????????sPs? ?? ? ? ? 4 0 !2 1! 2220 ???????????????sPL sq ??? ?qq LW hrs. (or minutes) 169。 2020 Pearson Education Little’s Law ?Little’s Law relates the number of customers in a waitingline system to the waiting time of customers. L = ?W L is the average number of customers in the system. ? is the customer arrival rate. W is the average time spent in system, including service. 169。 2020 Pearson Education ?In the finitesource model, the singleserver model assumptions are changed so that the customer population is finite, with N potential customers. ?If N is greater than 30 customers, then the singleserver model with an infinite customer population is adequate. FiniteSource Model 169。 2020 Pearson Education FiniteSource Model ? = Average utilization of the server = 1 – R0 Lq = Average number of customers in line = N – (1 – R0) ? + ? ? ? ? L = Average number of customers in the system = N – (1 – R0) Wq = Average waiting time in line = Lq [(N – L)?]–1 W = Average time in the system = L[(N – L)?]–1 R0 = probability of zero customers [∑ ( )n ]–1 N! (N – n)! ? ? N n=0 169。 2020 Pearson Education Decision Areas for Management ? Using waitingline analysis, management can improve the service system in one or more of the following areas. ?Arrival Rates ?Number of Service Facilities ?Number of Phases ?Number of Servers Per Facility ?Server Efficiency ?Priority Rule ?Line Arrangement 169。 2020 Pearson Education Application ? ?? ? ? ? ? ?0!8!7!8!8!81!!810100?????????????????????????????????NnnnNNP?? 0 ????? P?? ? ? ? 0 ??????? PNL ??169。 2020 Pearson Education Application ??? ???? ? ? ?? ?? ? ? ?? ?? ? ? ?? ? 222111000??????????????????PPP169。 2020 Pearson Education Application ? ? ???????????????????? ????? LLqm i n6m i 11 ??????? hrhrW ??
鄂ICP備17016276號-1