1 / 7

Kendell-Lee Notation for Queuing System

Kendell-Lee Notation for Queuing System 1 / 2 / 3 / 4 / 5 / 6 Arrival / Service / Parallel / Queue / Max / Population Process Process Servers Discip- Cus- Size line tomer M, D, Er, G, GI.

lavey
Download Presentation

Kendell-Lee Notation for Queuing System

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Kendell-Lee Notation for Queuing System 1 / 2 / 3 / 4 / 5 / 6 Arrival / Service / Parallel / Queue / Max / Population Process Process Servers Discip- Cus- Size line tomer M, D, Er, G, GI IE 417, Chap 20, Jan 99

  2. M / M / 1 / GD / /(Section 4) Steady-state condition: Little’s queuing formula This is independent of number of servers, queue discipline, interarrival time dist., service time dist. IE 417, Chap 22, April 99

  3. Burger-417 Fast-Food = 45#/hr = 0.75#/min = 60#/hr = 1#/min Based on solution on web. 1 teller 1 teller & cashier 2 tellers = 1 = 1.25 = 1 Lq# 2.25 0.9 0.12 L # 3 1.5 0.87 Wqmin 3 1.2 0.16 W min 4 2 1.16 0.75 0.6 0.38 0.25 0.4 0.45 Pw 0.75 0.6 0.20 P(j 5) 0.24 0.08 0.01 1 IE 417, Chap 22, May 99

  4. Different Types of Costs in Queuing Systems Loss in goodwill = ($/part) C Waiting time = ($/unit time) Cost of space = ($/part) Lq Loss of customer = ($/part) IE 417, Chap 22, April 99

  5. M / M / 1 / GD / C /(Section 5) For j = 1, …., C For j = 0, …., C For j = C+1, …., IE 417, Chap 22, May 99

  6. M / M / S / GD / /(Section 6) Steady-state condition: For j = 1, 2, …, S For j = S+1, S+2, …, Probability that an arriving unit has to wait: Table 6 page 1088 IE 417, Chap 22, May 99

  7. M / M / S / GD / /(Section 6) Cont. IE 417, Chap 22, May 99

More Related