SlideShare utilise les cookies pour améliorer les fonctionnalités et les performances, et également pour vous montrer des publicités pertinentes. Si vous continuez à naviguer sur ce site, vous acceptez l’utilisation de cookies. Consultez nos Conditions d’utilisation et notre Politique de confidentialité.

SlideShare utilise les cookies pour améliorer les fonctionnalités et les performances, et également pour vous montrer des publicités pertinentes. Si vous continuez à naviguer sur ce site, vous acceptez l’utilisation de cookies. Consultez notre Politique de confidentialité et nos Conditions d’utilisation pour en savoir plus.

Ce diaporama a bien été signalé.

Vous avez aimé cette présentation ? Partagez !

Aucun téléchargement

Nombre de vues

49 974

Sur SlideShare

0

Issues des intégrations

0

Intégrations

57

Partages

0

Téléchargements

0

Commentaires

12

J’aime

108

Aucune remarque pour cette diapositive

- 1. QUEUEING THEORY<br />OPERES3<br />
- 2. QUEUEING THEORY<br />I think I shall never see <br />a queue as long as this.<br />-Any Customer, Anytime, Anywhere<br />
- 3. A queue is a waiting line of "customers" requiring service from one or more servers. A queue forms whenever existing demand exceeds the existing capacity of the service facility; that is whenever arriving customers cannot receive immediate service due to busy servers. <br />Queueing Theory is the study of the waiting line systems. <br />QUEUEING THEORY<br />
- 4. STRUCTURE OF A QUEUEINGMODEL<br />Queueing System<br />
- 5. 1.0. The Arrival Process <br />A. The calling source may be single or multiple populations.<br />B. The calling source may be finite or infinite. <br />C. Single or bulk arrivals may occur. <br />D. Total, partial or no control of arrivals can be exercised by the <br />queueing system. <br />E. Units can emanate from a deterministic or probabilistic generating process. <br />F. A probabilistic arrival process can be described either by an empirical or a theoretical probability distribution. <br />G. A stationary arrival process may or may not exist. <br />COMPONENTS OF THE QUEUEING PROCESS <br />
- 6. 2.0 The Queue Configuration <br /> <br />The queue configuration refers to the number of queues in the system, their relationship to the servers and spatial consideration. <br /> <br />A. A queue may be a single queue or a multiple queue. <br />B. Queues may exist <br />B.1 physically in one place <br />B.2 physically in disparate locations <br />B.3 conceptually <br />B.4 not at all <br />C. A queueing system may impose restriction on the maximum number of units allowed. <br />COMPONENTS OF THE QUEUEING PROCESS <br />
- 7. 3.0 Queue Discipline <br />The following disciplines are possible: <br /> <br />A. lf the system is filled to capacity, the arriving unit is rejected <br />B. Balking - a customer does not join the queue <br />C. Reneging - a customer joins the queue and subsequently decides to leave <br />D. Collusion - customers collaborate to reduce waiting time <br />E. Jockeying - a customer switching between multiple queues <br />F. Cycling - a customer returning to the queue after being given service <br /> <br />Customers who do not balk, renege, collude, jockey, cycle, non-randomly select from among multiple queues are said to be patient. <br />COMPONENTS OF THE QUEUEING PROCESS<br />
- 8. 4.0 Service Discipline <br />A. First-Come, First-Served (FCFS) <br />B. Last-Come, First-Served (LCFS) <br />C. Service in Random Order (SIRO) <br />D. Round Robin Service <br />E. Priority Service <br />preemptive <br />non-preemptive <br />COMPONENTS OF THE QUEUEING PROCESS<br />
- 9. 5.0. Service Facility<br />A. The service facility can have none, one, or multiple servers. <br />B. Multiple servers can be parallel, in series (tandem) or both. <br />COMPONENTS OF THE QUEUEING PROCESS<br />Single Queue, Single Server <br />Multiple Queue, Multiple Servers<br />
- 10. 5.0. Service Facility<br />COMPONENTS OF THE QUEUEING PROCESS<br />Multiple Servers in Series <br />Single Queue, Multiple Servers <br />Channels in parallel may be cooperative or uncooperative. By policy, channels can also be variable. <br />Multiple Servers, both in series and parallel <br />
- 11. 5.0. Service Facility<br />C. Service times can be deterministic or probabilistic. Random variables may be specified by an empirical or theoretical distribution. <br />D. State: Dependent state parameters refer to cases where the parameters refer to cases where the parameters are affected by a change of the number of units in the system. <br />E. Breakdowns among servers can also be considered. <br />COMPONENTS OF THE QUEUEING PROCESS<br />
- 12. 1.0. Taxonomy of Queueing Models<br />A model may be represented using the Kendall- Lee Notation: <br />CLASSIFICATIONS OF MODELS AND SOLUTIONS <br />(a/b/c):( d/e/f) <br />where: <br /> a = arrival rate distribution <br /> b = service rate distribution <br /> c = no. of parallel service channels (identical service) <br /> d = service discipline <br /> e = maximum no. allowed in the system <br /> f = calling source <br />Common Notations: <br />M – Poissonl/Exponential rates <br />G - General Distribution of Service Times <br />Ek- Erlangian Distribution <br />
- 13. 2.0 Methods of Solution <br />A. Analytical: The use of standard queueing models yields analytical results. <br />B. Simulation: Some complex queueing systems cannot be solved analytically. (non-Poisson models) <br />3.0 Transient vs. Steady State <br />A. A solution in the transient state is one that is time dependent. <br />B. A solution is in the steady state when it is in statistical equilibrium (time independent) <br />CLASSIFICATIONS OF MODELS AND SOLUTIONS <br />
- 14. 4.0 Analytical Queueing Models - Information Flow <br />In steady state systems, the operating characteristics do not vary with time. <br />CLASSIFICATIONS OF MODELS AND SOLUTIONS <br />
- 15. Notations: <br />λc = effective mean arrival rate <br />λ = λc if queue is infinite <br />λe = λ - [expected number who balk if the queue is finite] <br />W = expected waiting time of a customer in the system <br />Wq = expected waiting time of a customer in the queue <br />L = expected no. of customers in the system <br />Lq = expected number of customers in the queue <br />Po = probability of no customers in the system <br />Pn = probability of n customers in the system <br />ρ = traffic intensity= λ/μ<br />ρc= effective traffic intensity= λe/μ<br />CLASSIFICATIONS OF MODELS AND SOLUTIONS <br />
- 16. The following expressions are valid for all queueingmodels.These relationships were developed by J. Little <br />Note: lf the queue is finite, λ is replaced by λe<br />GENERAL RELATIONSHIPS: (LITTLE'S FORMULA) <br />L=λW<br />Lq = λWq<br />W =Wq+1/μ<br />L= Lq + λ/ μ<br />
- 17. In the models that will be presented the following assumptions hold true for any model: <br />1. The customers of the queueing system are patient customers. <br />2. The service discipline is general discipline (GD), which means that the derivations do not consider any specific type of service discipline. <br />EXPONENTIAL QUEUEING MODELS <br />
- 18. The derivation of the queueing models involve the use of a set of difference-differential equations which allow the determination of the state probabilities. These state probabilities can also be calculated by the use of the following principle: <br />Rate-Equality Principle: The rate at which the process enters state n equals the rate at which it leaves state n.<br />EXPONENTIAL QUEUEING MODELS <br />
- 19. SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL [(M/M/1):(GD/ α /α)] <br />Characteristics: <br />1. Input population is infinite. <br />2. Arrival rate has a Poisson Distribution <br />3. There is only one server. <br />4. Service time is exponentially distributed with mean1/μ. [λ<μ] <br />5. System capacity is infinite. .<br />6. Balking and reneging are not allowed. <br />CASE 1: SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL <br />
- 20. Using the rate-equality principle, we obtain our first equation for this type of system: <br />To understand the above relationship, consider state 0. When in state 0, the process can leave this state only by an arrival. Since the arrival rate is λ and the proportion of the time that the process is in state 0 is given by Po, it follows that the rate at which the process leaves state 0 is λPo. On the other hand, state 0 can only be reached from state 1 via a departure. That is, if there is a single customer in the system and he completes service, then the system becomes empty. Since the service rate is μ and the proportion of the time that the system has exactly once customer is P1, it follows that the rate at which the process enters 0 is μPl. <br />CASE 1: SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL <br />λPo=μP1<br />
- 21. The balance equations using this principle for any n can now be written as:<br />CASE 1: SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL <br />State Rate at which the process leaves = rate at which it enters <br />0λP0=μP1<br />n ≥1 (λ + μ)Pn = λPn-1 + μPn+l<br />
- 22. In order to solve the above equations, we rewrite them to obtain <br />Solving in terms of P0 yields: <br />CASE 1: SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL <br />
- 23. In order to determine P0, we use the fact that the Pn must sum to 1, and thus <br />CASE 1: SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL <br />or<br />
- 24. Note that for the above equations to be valid, it is necessary for to be less than 1 so that the sun of the geometric progression customers in the system at any time, we use<br />The last equation follows upon application of the algebraic identity<br />CASE 1: SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL<br />
- 25. The rest of the steady state queueing statistics can be calculated using the expression for L and Little's Formula. A summary of the queueing formulas for Case I is given below.<br />CASE 1: SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL<br />
- 26. SUMMARY OF CASE 1 FORMULAS <br />
- 27. Example 1: Joe's Service Station operates a single gas pump. Cars arrive according to a Poisson distribution at an average rate of 15 cars per hour. Joe can service cars at the rate of 20 cars per hour with service time following an exponential distribution.<br />a) What fraction of the time is Joe busy servicing cars?<br />b) How many cars can Joe expect to find at his station?<br />c) What is the probability that there are at least 2 cars in the station?<br />d) How long can a driver expect to wait before his car enters the service facility?<br />e) If you need to put in gas at Joe's service station, how long will it take you on the average?<br />CASE 1: SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL<br />
- 28. Example 2: In the previous example, Joe is planning to set an area of land near the service facility to park cars waiting to be serviced. If each car requires 200 square feet on the average, how much space would be required?<br />CASE 1: SINGLE CHANNEL-POISSON/EXPONENTIAL MODEL<br />
- 29. MULTIPLE SERVER, POISSON/EXPONENTIAL MODEL [(M/M/C):(GD/∞/∞ )] <br />The assumptions of Case II are the same as Case 1 except that the number of service channels is more than one. For this case, the service rate of the system is given by: <br />CASE II : MULTIPLE SERVER, POISSON/EXPONENTIAL MODEL <br />cµ η ≥ c<br />ηµ η < c <br />
- 30. Thus, a multiple server model is equivalent to a single-server system with service rate varying with η. <br />Using the equality rate principle we have the following balance equations: <br />CASE II : MULTIPLE SERVER, POISSON/EXPONENTIAL MODEL <br />λη = λ & µη = ηµ η < c<br />µη = cµ η ≥ c<br />= 0<br />
- 31. CASE II : MULTIPLE SERVER, POISSON/EXPONENTIAL MODEL <br />
- 32. CASE II : MULTIPLE SERVER, POISSON/EXPONENTIAL MODEL<br />But:<br />Therefore:<br />η≥c<br />If ρ=λ/µ<br />
- 33. CASE II : MULTIPLE SERVER, POISSON/EXPONENTIAL MODEL<br />. Hence:<br />To solve for <br />, we note that <br />To solve for Lq:<br />(k=n-c)<br />
- 34. CASE II : MULTIPLE SERVER, POISSON/EXPONENTIAL MODEL<br />To simplify:<br />
- 35. SUMMARY OF CASE 2 FORMULAS:<br />
- 36. Example: Students arriving at a student registration center of a university must have their registration materials processed by an operator seated at a computer terminal. The systems design calls for 4 operators to be on duty, each operator performing an identical service. Students arrive according to a Poisson process at an average rate of 100 per hour. Each operator can process 40 students per hour with service time being exponentially distributed.<br />a) What fraction of the time that there are no students in the registration center?<br />b) If the waiting area inside the center building will comfortably accommodate five students, what percentage of time will there be students lined up outside the building?<br />c) How long on the average does student spend in the center building waiting?<br />d) On the average, can we expect a student arriving 3 minutes before closing time to make it just before closing? (He is able to register)<br />e) How long is the line of students waiting to register?<br />CASE II : MULTIPLE SERVER, POISSON/EXPONENTIAL MODEL<br />
- 37. SINGLE CHANNEL,POISSON ARRIVALS, ARBITRARY SERVICE TIME : Pollaczek - Khintchine Formula [(M/G/l): (GD/∞/∞)] <br />This case is similar to Case 1 except that the service rate distribution is arbitrary. <br />Let: <br /> N = no. of units in the queueing system immediately after a unit departs <br /> T = the time needed to service the unit that follows the one departing (unit 1) at the beginning of the time count. <br /> K= no. of new arrivals units the system during the time needed to service the unit that follows the one departing (unit 1) <br />Nl = no. of units left in the system when the unit (1) departs <br />CASE III: SINGLE CHANNEL,POISSON ARRIVALS, ARBITRARY SERVICE TIME<br />
- 38. CASE III: SINGLE CHANNEL,POISSON ARRIVALS, ARBITRARY SERVICE TIME<br />Then: <br />Nl = N + K – 1; if N = 0<br /> = K<br />Let:<br /> a = 1 if N = 0<br /> a = 0 if N > 0 a*N =0 <br />Then:<br />Nl = N + K + a – 1<br />
- 39. CASE III: SINGLE CHANNEL,POISSON ARRIVALS, ARBITRARY SERVICE TIME<br />In a steady state system: ~. <br /> E(N) = E(<br /> ) <br /> E (<br />) =E[ ] <br />) = <br />E (<br />E (a) = -E (K) + 1 <br />=<br />a*N= 0 <br /> =<br />Since a = 0 or 1: <br />But <br />
- 40. CASE III: SINGLE CHANNEL,POISSON ARRIVALS, ARBITRARY SERVICE TIME<br />Therefore : <br />but E(a) = 1 - E(K) <br />Then: <br />
- 41. CASE III: SINGLE CHANNEL,POISSON ARRIVALS, ARBITRARY SERVICE TIME<br />If the arrival rate is Poisson <br />E(K/t) = λt<br />But in a Poisson Distribution: Mean = Variance<br />E (K2/t) = λt + (λt)2<br />
- 42. CASE III: SINGLE CHANNEL,POISSON ARRIVALS, ARBITRARY SERVICE TIME<br />
- 43. CASE III: SINGLE CHANNEL,POISSON ARRIVALS, ARBITRARY SERVICE TIME<br />Substituting and solving for E(N): <br />The other quantities can be solved using the general relationships derived by Little.<br />
- 44. SUMMARY OF CASE III QUEUEING FORMULAS<br />
- 45. Example: Arrivals at the AAA Transmission Repair are observed to be random at the Poisson rate of 1.5 per day. The time required to repair transmission varies and the probability distribution is given below:<br />Determine the steady state statistics of this system.<br />CASE III: SINGLE CHANNEL,POISSON ARRIVALS, ARBITRARY SERVICE TIME<br />
- 46. POISSON ARRIVAL AND SERVICE RATE, INFINITE NUMBER OF SERVERS: Self-Service Model [(M/M/∞): (GD/∞/∞)]<br />Consider a multiple server system. The equivalent single server system if the number of servers is infinite would be:<br />From the multiple server system:<br />CASE IV: POISSON ARRIVAL AND SERVICE RATE, INFINITE NUMBER OF SERVERS<br />
- 47. CASE IV: POISSON ARRIVAL AND SERVICE RATE, INFINITE NUMBER OF SERVERS<br />But <br />Therefore:<br />Since the number of servers is infinite: Lq = Wq = 0.<br />
- 48. CASE IV: POISSON ARRIVAL AND SERVICE RATE, INFINITE NUMBER OF SERVERS<br />Solving for L:<br />
- 49. SUMMARY OF CASE IV QUEUING FORMULAS<br />(No Restriction)<br />(Poisson Distributed)<br />
- 50. Example: Supershopper Supermarket has 15 customers entering per hour. The customer spends an exponentially distributed amount of time shopping. The average time spent shopping is 20 minutes.<br />a) On the average, how many customers can be found shopping in the aisles?<br />b) What is the average length of time a customer spends shopping in the aisles?<br />c) Find the probability of there being 6 or more customers in the aisles.<br />CASE IV: POISSON ARRIVAL AND SERVICE RATE, INFINITE NUMBER OF SERVERS<br />
- 51. SINGLE CHANNEL, POISSON/EXPONENTIAL MODEL, FINITE QUEUE [(M/M/1) : (GD/m/∞)]<br />This case is similar to Case 1 except that the queue is finite, i.e., when the total number of customers in the system reaches the allowable limit, all arrivals balk.<br />CASE V: SINGLE CHANNEL, POISSON/ EXPONENTIAL MODEL, FINITE QUEUE<br />
- 52. Let m = maximum number allowed in system<br />The balance equations are obtained in the same manner as before.<br />n=0:<br />n=1:<br />CASE V: SINGLE CHANNEL, POISSON/ EXPONENTIAL MODEL, FINITE QUEUE<br />
- 53. n=m-1:<br />n=m:<br />But<br />Where is a finite geometric series with sum<br />Therefore:<br />CASE V: SINGLE CHANNEL, POISSON/ EXPONENTIAL MODEL, FINITE QUEUE<br />
- 54. Now<br />CASE V: SINGLE CHANNEL, POISSON/ EXPONENTIAL MODEL, FINITE QUEUE<br />.<br />.<br />.<br />
- 55. SUMMARY OF CASE V QUEUEING FORMULA<br />
- 56. Example: The owner of a small full-service gas station operates it by himself. On Friday afternoon, customers arrive at the rate of 12 per hour. On the average, service takes 3 minutes and tends to be exponential. The space allows the accommodation of only 3 cars at one time (including the one being serviced).<br />a) What is the mean number of customers in the station?<br />b) What fraction of the time will the owner be idle?<br />c) What fraction of customers will be lost?<br />d) What is the mean customer waiting time in the queue?<br />e) What is the probability that a customer waits?<br />CASE V: SINGLE CHANNEL, POISSON/ EXPONENTIAL MODEL, FINITE QUEUE<br />
- 57. MULTIPLE CHANNEL, POISSON EXPONENTIAL MODEL, FINITE QUEUE [(M/M/c):(GD/m/∞)]<br />This case is an extension of Case V. We assume that the number of service channels is more than one. For this system: <br />CASE VI : MULTIPLE CHANNEL, POISSONEXPONENTIAL MODEL, FINITE QUEUE<br />
- 58. The balance equations are similar to Case II. The manipulation of equations is basically the same. The following are the results. <br />CASE VI : MULTIPLE CHANNEL, POISSONEXPONENTIAL MODEL, FINITE QUEUE<br />
- 59. As in Case V, we solve for:<br />This expression is used in solving for the other statistics.<br />CASE VI : MULTIPLE CHANNEL, POISSONEXPONENTIAL MODEL, FINITE QUEUE<br />
- 60. Example: Consider a barbershop with 3 barbers and 2 additional chairs for waiting customers. Customers arrive randomly at an average rate of 8 per hour, and haircuts take an average of 15 minutes, with an exponential distribution. Arriving customers who find the barbershop busy and 2 customers waiting leave immediately.<br />a) What is the mean number of customers waiting at any time?<br />b) What is the mean time a customer spends in the barbershop?<br />c) Determine the mean number of customers in the barbershop?<br />d) What fraction of the time are the barbers idle?<br />CASE VI : MULTIPLE CHANNEL, POISSONEXPONENTIAL MODEL, FINITE QUEUE<br />
- 61. MACHINE SERVICING MODEL [(M/M/R):(GD/K/K)]<br />This model assumes that R repairmen are available for servicing a total of K machines. Since a broken machine cannot generate new calls while in service, this model is an example of finite calling source. This model can be treated as a special case of the single server, infinite queue model. <br />CASE VII : MACHINE SERVICING MODEL <br />
- 62. Moreover, the arrival rate λ is defined as the rate of breakdown per machine. Therefore:<br />CASE VII : MACHINE SERVICING MODEL <br />
- 63. The balance equations yield the following formulas for the steady state system: <br />The other measures are given by:<br />CASE VII : MACHINE SERVICING MODEL <br />
- 64. To solve for the effective arrival rate, we determine:<br />CASE VII : MACHINE SERVICING MODEL <br />
- 65. Example: Two repairmen are attending five machines in a workshop. Each machine breaks down according to a poisson distribution with a mean of 3 per hour. The repair time per machine is exponential with a mean of 15 minutes.<br />a) Find the probability that the two repairmen are idle. That one repairman is idle.<br />b) What is expected number of idle machines not being repaired?<br />CASE VII : MACHINE SERVICING MODEL <br />
- 66. COSTS INVOLVED IN THE QUEUEING SYSTEM <br />1. FACILITY COST - cost of (acquiring) services facilities <br />Construction (capital investment) expressed by interest and amortization <br />Cost of operation: labor, energy & materials <br />Cost of maintenance & repair <br />Other Costs such as insurance, taxes, rental of space <br />2. WAITING COST - may include ill-will due to poor service, opportunity loss of customers who get impatient and leave or a possible loss of repeat business due to dissatisfaction. <br />ECONOMIC CONDITIONS<br />
- 67. The total cost of the queueing system is given by: <br />ECONOMIC CONDITIONS<br />TC = SC+WC <br />where: <br /> SC = facility (service cost)cost <br /> WC = waiting cost or the cost of waiting (in queue & while being served) per unit time <br /> TC = Total Cost <br />
- 68. ECONOMIC CONDITIONS<br />Let: <br />Cw = cost of having 1 customer wait per unit time <br />Then <br />WCw = average waiting cost per customer <br />But since λ customers arrive per unit time: <br />WC = λ WCw = LCw<br />
- 69. The behavior of the different cost Component is depicted in the following graph:<br />ECONOMIC CONDITIONS<br />
- 70. Management Objective: Cost Minimization or Achieving a Desired Service Level <br />An example of a desired service level is the reduction of waiting time of customers. The minimization of cost would involve the minimization of the sum of service cost and waiting cost. <br />The decision is a matter of organizational policy and influenced by competition and consumer pressure. <br />ECONOMIC CONDITIONS<br />
- 71. Example 1: A firm operates a single-server maintenance storeroom where electrical repair persons check out needed spare parts and equipment. Repair persons arrive at a rate of 8 per hour. The service rate is 10 per hour. Arrivals are Poisson distributed and service completion times follow the exponential model. The cost of waiting is Php 9 per hour. The company is considering giving the stock clerk a helper which would increase the service rate to 12 per hour. The cost of the helper is Php 6 per hour. What do you recommend?<br />ECONOMIC CONDITIONS<br />
- 72. Example 2: An engineering design firm is replacing its scientific computer, which is sued to solve problems encountered in design projects. The list of alternatives has been narrowed to 3 computers.<br /> Computation times are exponential and arrivals of problems at the computer center follow a poisson distribution at mean rate if 15 per day. Progress on a project is delayed until a problem is solved. The daily cost of delaying a project is Php250. Which computer should be selected?<br />ECONOMIC CONDITIONS<br />

Aucun clipboard public n’a été trouvé avec cette diapositive

Il semblerait que vous ayez déjà ajouté cette diapositive à .

Créer un clipboard

Identifiez-vous pour voir les commentaires