PBW 654 Applied Statistics - I Urban Operations Research
|
|
- Basil Grant
- 5 years ago
- Views:
Transcription
1 PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction
2 Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization Nonlinear Programming explicitly represent uncertain data via random variables or stochastic processes; usually involves estimating system performance by simulating the system Stochastic Models Discrete-Time Markov Chains Continuous-Time Markov Chains Queuing Systems Decision Analysis assume all data are known with certainty; usually involves optimization
3 Applications of Queueing Theory Some familiar queues, Airport check-in Automated Teller Machines (ATMs) Fast food restaurants On hold on an 800 phone line Urban intersection Aircraft in a holding pattern Calls to the police or to utility companies Level-of-service (LOS) standards Queuing theory predicts various characteristics of waiting lines (or queues) such as average waiting time Economic analyses involving trade-offs among operating costs, capital investments and LOS
4 Structure of a Waiting Line System Queuing theory is the study of waiting lines In many service systems, queues form when demand for service exceeds capacity of service Queuing theory is the study of: Waiting times Delays Interaction between service demand and service capacity Four characteristics of a queuing system are, the manner in which customers arrive the time required for service the priority determining the order of service the number and configuration of servers in the system
5 Queueing Process and Queueing System Arrival point at the system Source of users/ customers Queue Queueing System C C C C C C C C C C C C C Servers Departure point from the system Arrivals process Size of user source Queue discipline and Queue capacity Service process Number of servers
6 Structure of a Waiting Line System Distribution of Arrivals Generally, the arrival of customers into the system is a random event Frequently, the arrival pattern is modeled as a Poisson process Distribution of Service Times Service time is also usually a random variable A distribution commonly used to describe service time is the exponential distribution
7 Structure of a Waiting Line System Queue Discipline Most common queue discipline is first come, first served (FCFS) Book stacks are examples of last come, first served (LCFS) queue discipline Other disciplines assign priorities to the waiting units and then serve the unit with the highest priority first
8 Structure of a Waiting Line System Single Service Channel System Customer arrives Waiting line S 1 Customer leaves Multiple Service Channels System S 1 Customer arrives Waiting line S 2 Customer leaves S 3
9 Structure of a Waiting Line System Queuing Analysis is useful for Setting level-of-service standards Congestion pricing Economic analysis involving trade-offs among operating costs, capital investments and LOS Cost Total cost Optimal cost Cost of building the capacity Cost of losses due to waiting Optimal capacity Capacity
10 A Code for Queueing Models: A/B/m A three part code of the form A/B/k is used to describe various queuing systems A identifies the arrival distribution, B the service (departure) distribution, and k the number of channels for the system Distribution of service time Queueing System Number of servers / / Distribution of interarrival time Customers Queue C C C C C C C C C C S S S S Service facility
11 A Code for Queueing Models: A/B/m Symbols used for the arrival and service processes are, M - Markov distributions (Poisson/exponential), D - Deterministic (constant) and G - General distribution (with a known mean and variance) For example, M/M/k refers to a system in which arrivals occur according to a Poisson distribution, service times follow an exponential distribution and there are k servers working at identical service rates
12 Terminology and Notation State of system, number of customers in queueing system Queue length, number of customers waiting for service N(t) = number of customers in queueing system at time t P n (t) = probability that N(t) is equal to n n, mean arrival rate of new customer when N(t) = n n, mean (combined) service rate when N(t) = n Transient condition, state of system at t depends on the state of the system at t=0 or on t-1 Steady state condition, system is independent of initial state and t K, number of servers (parallel service channels) If arrival rate and the service rate per busy server are constant, then n =, n =s 1 1 Expected interarrival time = Expected service time =
13 Quantities of Interest at Steady State Given = arrival rate = service rate per service channel Unknowns L = expected number of users in queueing system (L = lim t-> E(N(t))) L q = expected number of users in queue (L q = lim t-> E(N q (t))) W = expected time in queueing system per user (W = lim i-> E(w(i))) W q = expected waiting time in queue per user (W q = lim i-> E(w q (i))) Four unknowns, four equations
14 Little s Law... Number of users The expected # of users in the system at any instant between 0 & T is denoted by L T A(t), cumulative arrivals to the system C(t), cumulative service completions in the system A(t) N(t) C(t) N(t) = A(t) - C(t) The area between the 2 curves is the total customer time i.e. total time in the system spent by all users up to time T It is the total customer time between 0 & T divided by T L T T 0 N( t) dt T A( T ) T t T 0 N( t) dt A( T) T T W T Time
15 Relationships between L, L q, W, W q 4 unknowns, L, W, L q, W q Need 4 equations. We have the following 3 equations, 1. L = W (Little s law) 2. L q = W q 3. W = W q + 1/µ If we know L (or any one of the four expected values), we can determine the value of the other three The determination of L may be hard or easy depending on the type of queueing model at hand (i.e. M/M/1, M/M/s, etc.) L np n (P n : probability that n customers are in the system) n 0 As T->, the state of the system is independent of initial condition - That is, it is in steady state The expected # of users in a system indicates well the expected waiting time in that system & vice versa
16 Queuing System Input Characteristics = the average arrival rate 1/ = the average time between arrivals µ = the average service rate for each server 1/µ = the average service time P 0 = probability the service facility is idle P n = probability of n units in the system P w = probability an arriving unit must wait for service (P K ) L q = average number of units in the queue awaiting service L = average number of units in the system W q = average time a unit spends in the queue awaiting service W = average time a unit spends in the system
17 Analytical Formulas For nearly all queuing systems, there is a relationship between the average time a unit spends in the system or queue and the average number of units in the system or queue These relationships, known as Little's flow equations are, L = W and L q = W q
18 Analytical Formulas When the queue discipline is FCFS, analytical formulas have been derived for several different queuing models including the following: M/M/1 M/M/k M/G/1 others Analytical formulas are not available for all possible queuing systems. In this event, insights may be gained through a simulation of the system (covered later in the course)
19 Interarrival Time and Service Time 0, 0 0, ) ( Density function : t t e t f t T time random variable (service) Interarrival T : 2 1 ) var(, 1 ) (, 1 } {0 T T E e t T P t } {0, small For t t T P t Service Time : ; Time : Interarrival
20 Birth-and-Death Queuing Systems Characteristics of B&D Queuing Systems m parallel, identical servers Infinite queue capacity Whenever n users are in the system (in queue plus in service) arrivals are Poisson at rate of n per unit of time Whenever n users are in the system, service completions are Poisson at rate of n per unit of time First-Come-First-Served Discipline We are now interested in determining L for the B&D Queuing Systems then use equations 1, 2 and 3 to determine the 3 other unknowns We know that L n 0 np n
21 Birth-and-Death Queuing Systems Let s derive P n from first principles Time t Probability of one arrival in the next t n users n+1 users n t 1 n n t n t n 1 t Time t+ t n+1 users n users n-1 users n+2 users n+1 users n users n1 t n users n-1 users n-1 users n-2 users
22 Birth-and-Death Queuing Systems The probability of n users in the system at time (t+ t) is P n (t+ t) P n t t P n t1 n n t After a simple manipulation P n t t P n t t P 0 t t P n t t 1 P 1 t 0 P 0 t for n = 0 P n1 t n1 t P n1 t n1 t n n P n t n 1 P n 1 t n1 P n1 t n = 1,2,3, This system of equations is known as Chapman-Kolmogorov equations for a B&D system
23 Birth-and-Death Queuing Systems We know consider the situation in which the queuing system has reached steady state, i.e. t is large enough to have P n (t)= P n independent of t or P n t t 0 Then the system of equations provide the state balance (or equilibrium equations) 0 P 0 1 P 1 for n = 0 n n P n n1 P n 1 n1 P n1 n = 1,2,3,
24 Birth-and-Death Queuing Systems The state balance equations can also be written directly from the state transition diagram State transition diagram for the B&D system For a birth-death process 0 P 0 1 P 1 1 P 1 2 P 2 n P n n 1 P n n-1 n n n2 n1 n n1 n n 1 n 1 n 2
25 Birth-and-Death Queuing Systems We need to calculate P n (to compute L) 0 P 0 1 P 1 --> n n P n n1 P n 1 n1 P n1 for n = 1 --> P P P 1 2 P 2 0 P 0 1 P 1 1 P 1 2 P 2 0 P 0 P P 1 P P 0
26 Birth-and-Death Queuing Systems In general P n n1 n n n P 0 k n P 0 We also have 1 P n k n P 0 k 0 P 0 k n P 0 n 0 n 0 1 P 0 1 k n P 0 n1 n1 P 0 K 0 = 1,why? 1 1 k n P 0 n1
27 Birth-and-Death Queuing Systems Since at steady state the probability of 0 users in the system have to be positive (otherwise queue will grow indefinitely), then k n n1 The condition for steady state Also, if Po is zero, all other probabilities will be zero (i.e. the # of users in the system never stabilizes) Note that P n is a function of 1, 2 & 1, 2,.
28 State Transition Diagram for M/M/1 States, n-1 n n+1 During t: P0 t n-1 n+1 n P1 t P1 t P2 t 2 P n 2 t P n 1 t P n t P t P t 3 n 1 P n t P t P n 1 t 1 t P n 2 t P n State Transition Diagram n-1 n+1 n
29 Observing State Transition Diagram from One Point At state 1, P 1 P 1 P 0 P 2 For a birth-death process λp 0 P 1 P1 P n-1 n+1 n Pn Pn 1
30 Derivation of P 0 and P n Putting it all together: ,,, P P P P P P n n Since , n n n n n n P P P Let 1) ( then, 0 0 n n n n Therefore ) (1 and n n n n P P r r a n 1 1
31 Derivation of L, W, W q, and L q 1 ) (1 ) (1 1 ) (1 1 1 ) (1 ) (1 ) (1 ) (1 ) ( d d d d n n n np L n n n n n n n n n n 1 1 L W ) ( W W q ) ( ) ( 2 q L q W
32 Back to Queuing Systems Significant amount of time spent in waiting lines by people, products, etc. Providing quick service is an important aspect of quality customer service The basis of waiting line analysis is the trade-off between the cost of improving service and the costs associated with making customers wait
33 Elements of Waiting Line Analysis Waiting lines form because people or things arrive at a service faster than they can be served Most operations have sufficient server capacity to handle customers in the long run Customers, however, do not arrive at a constant rate nor are they served in an equal amount of time Waiting lines are continually increasing and decreasing in length and approach an average rate of customer arrivals and an average service time, in the long run Decisions concerning the management of waiting lines are based on these averages for customer arrivals and service times They are used in formulas to compute operating characteristics of the system which in turn form the basis of decision making
34 Elements of Waiting Line Analysis If there are s servers, each with same service rate, then = customer arrival rate per unit time s = customer service capacity per unit time ρ = /s = utilization factor The systems we study will have ρ < 1, because otherwise the # of customers in the system will grow without bound We will be interested in the steady-state behavior of queuing systems (the behavior for large t)
35 Performance Questions What is the average number of customers in system/queue? 2 - average time a customer spends in system/queue? 3 - probability a customer is rejected? 4 - fraction of time a server is idle? These questions are aimed at characterizing complex systems, analyses used to support decision-making In queuing, OR takes the form of asking what if questions rather than trying to optimize the design
36 Telephone Answering System Example Situation, A utility company wants to determine a staffing plan for its customer representatives Calls arrive at an average rate of 10 per minute, and it takes an average of 1 minute to respond to each inquiry Both arrival and service processes are Poisson Problem, Determine the number of operators that would provide a satisfactory level of service to the calling population Analysis, = /s < 1 or s > / = 10
37 Single-Server Waiting Line System Characteristics for Fast Shop Market = 24 customers per hour arrive at checkout counter = 30 customers per hour can be checked out P 0 = (1 - /) = (1 24/30) = 0.2, the percentage of the system being idle L = / ( - ) = 24/ (30-24) = 4, the avg. no. of customers in the system L q = 2 / ( - ) = 24 2 / 30(30-24) = 3.2, the avg. no. of customers waiting in the queue
38 Single-Server Waiting Line System Characteristics for Fast Shop Market W = 1/( - ) = L / = 1/ (30 24) = hours [10 mins], the avg. time in the system per customer W q = / ( - )=L q /= 24/ [30(30 24)]=0.133 hours [8 mins], the avg. time in the waiting line per customer U = / = 24/ 30 = 0.8, the probability the server is busy
39 M/M/1 Queuing System Single channel Poisson arrival-rate distribution Exponential service-time distribution Unlimited maximum queue length Infinite calling population Examples, Single-window theatre ticket sales booth Single-scanner airport security station Single-lane right-turn stop-sign intersection
40 Stop-Sign Intersection Example M/M/1 Queuing Systems Cars arrive at a single-lane right-turn stop-sign intersection at a mean rate of 10 per minute, according to a Poisson process with the interarrival time being exponentially distributed. Each car arriving at the intersection requires an average of four seconds to cross the intersection, with the crossing time being exponentially distributed
41 Stop-Sign Intersection Example Question What is the mean service rate per minute? Answer Since one car can cross the intersection in an average time of 4 seconds (= 4/60 min.), then the mean service rate, µ, is µ = 1/(mean service time), or 60/4 m = 15/min
42 Stop-Sign Intersection Example Question What is the average time a car must wait from the time it arrives at the intersection until it is finished crossing the intersection (i.e. its turnaround time)? Answer This is an M/M/1 queue with = 10 per minute and = 15 per minute. The average time a car waits in the system is: W = 1/(µ - ) = 1/(15-10) = 1/5 minute or 12 seconds
43 Stop-Sign Intersection Example Question What is the average number of cars that are waiting at the intersection to cross? Answer Average number of cars waiting in the queue is: L q = 2 /[µ(µ - )] = (10) 2 /[(15)(15-10)] = 100/75 = 4/3
44 Stop-Sign Intersection Example Question What percentage of the time is the intersection busy? Answer The percentage of time the intersection is busy is equivalent to the utilization factor, /. Thus, the percentage of time is: / = 10/15 = 2/3 or 66.67%
45 Stop-Sign Intersection Example Poisson Arrival Rate (min) Exponential Service Rate (min) Operating Characteristics Probability of no cars at the intersection Average number of cars waiting Average number of cars at the intersection Average time a car waits Average time a car spends at the intersection Probability a car must wait upon arrival Po Lq L Wq W Pw 0.667
46 M/M/1 Queuing System - Details M / M / 1 arrival service # of process process servers M stands for Markovian, meaning exponential inter-arrival exponential service times M/M/1 systems with FCFS queue discipline and infinite queue capacity at steady state where = /, utilization factor...
47 M/M/1 Queuing System - Details L W 1 W q ( ) L q 2 ( ) Two points to observe: 1 - L is not equal to L q +1 It can be shown that L q = L - /, and / is <1 If you visit the system at steady state a very long # of times and each time you observe the # of customers in system and the # of customers in queue. In several times, you will find 0 customers in the system & 0 customers in the queue. Hence, L q L - 1
48 M/M/1 Queuing System - Details Two points to observe: 1 - L is not equal to L q +1 You can think of the equation [L q = L - /] as: At any point in time during the steady state, the expected # of customers in the queue is the expected # of customers in the system minus a portion of a customer in service
49 M/M/1 Queuing System - Details Two points to observe: 2 - High sensitivity of delay at high levels of Utilization Recall: [W= 1 / ( - )] Expected Delay capacity = 1 An increase in demand at point X 2 would result in much higher increase in delay compared to the increase caused by increase in demand at point X 1 X 1 X 2 demand i.e. L, L q, W, W q all grow in proportion to [(1- )] which becomes very high as approach 1
50 M/M/1 Queuing System - Details An alternative, direct derivation of L & W For M/M/1 system with FCFS discipline 1 W P P P Probability of finding 1 person in system Wait time for arriving customers is the expected service time of the customer already in service plus the expected service time for the arriving customer
51 M/M/1 Queuing System - Details An alternative, direct derivation of L & W For M/M/1 system with FCFS discipline W n 0 n 1 P n E n 1 E n 1 W L 1 & from Little s Law, we have L W 1 L W
52 M/M/1 Queuing System - Details What is the expected length of a busy period, E[B]? if you observe the system for a very long period of time during steady state You will observe periods of Busy (B) & periods of Idle (I) I B I B I B
53 M/M/1 Queuing System - Details What is the expected length of a busy period, E[B]? Total Time when System is Idle P 0 Total Time EI P 0 EI EB but P 0 1 & EI 1 If at some instant the system had one customer only who has just departed, time to the next arrival is exponential distributed with mean 1/
54 M/M/1 Queuing System - Details What is the expected length of a busy period, E[B]? EB 1 EI EIP 0 P 0 EB EB E B 1 W
55 M/M/1 Queuing System - Details f W f W w 1 e w e w 1 w e w,w 0 e 1 w Let a f W w ae aw,w 0 an exponential distribution The time per customer spent in M/M/1 system at steady state is a RV that is exponentially distributed with parameter (-) Ew 1 Vw 1 2 As 1, the expected wait time grows fast, but the variance grows even faster
56 Two-Lanes Stop-Sign Intersection M/M/2 Queuing System Consider the previous example with the new configuration. Note that the arrival rate of cars at the two-lanes stop sign intersection is now 15 cars per minute, with the same 4 seconds required for crossing the intersection, through any of the two-lanes available
57 M/M/m Queuing System Let s consider now M/M/m system with FCFS discipline & infinite queue capacity: Define n : # of customers in system m : # of parallel & identical servers : arrival rate : service rate of each server
58 M/M/m Queuing System When n < m rate of arrivals & n rate of departures When n m & m P 0 P m-1 m m+1 P 1 2P P 1 P 0 P 2 2 P 1 P P 0 2! n P n P 0,n 0,1,2,...,m 1 n! P 0 m 1 m P n mp n 1 m m n P n m nm m! P 0 for n m,m 1,m 2,...
59 M/M/m Queuing System P n P 0 n P 0 n 0,1,...,m 1 n! n m! P 0 n m,m 1,m 2,... m1 n0 m nm n! n m! m We know that m n 0 m 1 P n 1
60 M/M/m Queuing System !! m m n P m m n n m 1 m m m m m m m n Consider z z z z z z z m z / 1 1! ) / ( ) / (! ) / (! ) / ( 0 0
61 M/M/m Queuing System We can derive that L q m m m! 1 P 2 0 m W q L q W W q 1 L W
62 ABC Bank Queuing System Problem Statement, ABC Bank loan officer customer interviews Inputs, Customer arrival rate of four per hour, Poisson distributed; Officer interview service time of 12 minutes per customer Questions, Determine operating characteristics for this system Assume an additional officer creating a multiple-server queuing system with two channels; determine operating characteristics for this system
63 ABC Bank Queuing System Solution for M/M/1, Determine Operating Characteristics for the Single-Server System = 4 customers per hour arrive, = 5 customers per hour are served P o = (1 - / ) = ( 1 4 / 5) =.20 the probability of no customers in the system L = / ( - ) = 4 / (5-4) = 4 customers on average in the queuing system L q = 2 / ( - ) = 4 2 / 5(5-4) = 3.2 customers on average in the waiting line
64 ABC Bank Queuing System W = 1 / ( - ) = 1 / (5-4) = 1 hour the average time in the system W q = / (u - ) = 4 / 5(5-4) = 0.80 hour (48 minutes) the average time in the waiting line P w = / = 4 / 5 = 0.80 the probability the new accounts officer is busy and a customer must wait
65 ABC Bank Queuing System Solution for M/M/2, = 4 customers per hour arrive, = 5 customers per hour are served per server S = 2 servers P o = the probability of no customers in the system L = customers on average in the queuing system L q = customers on average in the waiting line
66 ABC Bank Queuing System W = hour the average time in the system W q = hour the average time in the waiting line - P w = = (1 P0 P1) = Pw = Pk, probability of having m and m + customers = (1 sum (Pi) where I = 0 to number of servers.. - probability the system is busy = U the probability the new accounts officers are busy and a customer must wait
67 ABC Bank Queuing System M/M/1 M/M/2 P o L L q W 1 hour hour W q 0.8 hour hour P w
68 M/M/ Queuing System A special case of M/M/m is M/M/ (i.e. infinite # of servers) In this case, no customer has to wait in queue Each arriving customer will find a server available P 0 P n-1 n n+1 P 1 2P n 1 n P n n 1P n 1 n 1 n 2
69 M/M/ Queuing System P n n 0 n n! n n! P n P 0 P 0 n n! 1 P 0 e n 0,1,..., n 0 1 n n! n 0,1,2,..., 1 P 0 e What distribution is this?
70 M/M/ Queuing System Remarkable results The number of customers in system (which is also the # of busy servers) at steady state is Poisson distributed with parameter (/) W q W 1 0 L E n W L 1 L q L 0 This special case of M/M/ is applicable when you have a system of multiple servers where you have a very low probability that all servers are busy simultaneously (e.g. fire station)
71 M/M/1 Queuing System - with finite system capacity K k-1 k recall that P n n P 0 k k P n 1 n P 0 n 0 n 0 P n n 1 1 k1 n 0,1,2,...,k New customers finding the system full are lost n 0,1,...,k 1 P k 1 Now we have expressions for L, Lq, W, Wq -- see Table 4.1 in the text book
72 M/M/1 Queuing System - with finite system capacity K Note that: Steady state is always reached, even when > 1 There is an upper limit on how low the queue can get Be careful in applying Little s Law must count only the customers who actually join the system Effective arrival rate (i.e. discounting customers who get turned away) 1 P k Probability that the queue is saturated (i.e. full) It is also the fraction of potential customers who get turned away L L q W W q W W q 1
73 M/M/m Queuing System - with finite system capacity K QuickTime and a TIFF (Uncompressed) decompressor are needed to see this picture. Check Table 4.1 for closed-form expressions (derived from system balance equations) for Pn, L, Lq, W, Wq
74 M/M/m Queuing System - with finite system capacity K A special case of the above system is M/M/m with finite capacity m (i.e. k = m, that is no queuing space is available) QuickTime and a TIFF (Uncompressed) decompressor are needed to see this picture. P n n n! i i! m i 0 n 0,1,2,...,m The probability of full system is Pm, is known as Erlang s loss formula -- it is widely tabulated for different value of (/)
75 Two-Lanes Stop-Sign Intersection M/M/2 Queuing System Consider the previous example with the new configuration. Note that the arrival rate of cars at the two-lanes stop sign intersection is now 15 cars per minute, with the same 4 seconds required for crossing the intersection, through any of the two-lanes available
76 Two-Lanes Stop-Sign Intersection Question Is a single lane sufficient to handle the new arrival pattern of cars at the intersections? Answer Since one lane handles arriving cars at a mean rate of µ = 15 per minute, then = µ = 15 and the utilization factor is 1 This implies the queue of cars will grow infinitely large. Hence, a single lane is not sufficient and cannot handle this increase in demand
77 Two-Lanes Stop-Sign Intersection Question What is the probability that the right-turn two-lanes are not busy at any point in time? Answer Given that = 15, µ = 15, k = 2 and ( /µ) = 1, the probability that both lanes are empty is: P 0 k1 n 0 ( /) n n! 1 ( /)k k! ( k k ) = 1/[(1 + (1/1!)(15/15)1] + [(1/2!)(1) 2 ][2(15)/(2(15)-15)] = 1/( ) = 1/3 =.333 (33.3%)
78 Two-Lanes Stop-Sign Intersection Question What is the average turnaround time for a car arriving at the two-lanes right-turn stop-sign intersection? Answer The average turnaround time is the average waiting time in the system, W L = L q + (/µ) = 1/3 + (15/15) = 4/3 W = L/= (4/3)/15 = 4/45 min. = 5.33 sec
79 Two-Lanes Stop-Sign Intersection Question What is the average number of cars waiting at the two-lanes right-turn stop-sign intersection to cross? Answer The average number of orders waiting to be filled is L q, this was calculated earlier as 1/3
80 Two-Lanes Stop-Sign Intersection Spreadsheet Solution Number of Lanes Mean Arrival Rate (Poisson) Mean Service Rate (Exponential ) Operating Characteristics Probability of no cars in system Average number of cars waiting Average number of cars in system Average time (min) a car waits Average time (min) a car is in system Probability a car must wait k Po Lq L Wq W Pw 0.500
81 Two-Lanes Stop-Sign Intersection Economic Analysis of Queuing Systems Over time, it was observed that the demand at this right-turn intersection increased to 20 cars per minute. The city needs to decide whether to add a new lane to the two-lanes street or not. Given that a car needs 4 seconds to cross the intersection using any lane, and the following, The maintenance cost for one lane is $20/min Based on a number of factors, it was determined that the average waiting cost per second for a car to be $0.50 Assess the feasibility of this project, based on the minute cost (i.e. compare the cost per minute of having 2 lanes with that of having 3 lanes)
82 Two-Lanes Stop-Sign Intersection Economic Analysis of Queuing Systems Total Cost per Minute = (Total maintenance cost per minute) + (Total cost per minute for cars in the system) = ($20 per lane per minute) x (Number of lanes) + ($30 waiting cost per minute) x (Average number of cars in the system) = 20k + 30L Thus, L must be determined for k = 2 lanes and for k = 3 lanes with = 20/min. and = 15/min
83 Two-Lanes Stop-Sign Intersection Cost of Two Lanes P 0 k1 n 0 ( /) n n! 1 ( /)k k! ( k k ) P 0 = 1 / [1+(1/1!)(20/15)]+[(1/2!)(20/15) 2 (2(15)(2(15)-20))] = 1 / [1 + (4/3) + (8/3)] = 1/5
84 Two-Lanes Stop-Sign Intersection Cost of Two Lanes Thus, L = L q + ( /µ) = 16/15 + 4/3 = 2.40 Total Cost = (20)(2) + 30(2.40) = $ per minute
85 Two-Lanes Stop-Sign Intersection Cost of Three Lanes P 0 k1 n 0 ( /) n n! 1 ( /)k k! k ( k ) P 0 = 1/[[1+(1/1!)(20/15)+(1/2!)(20/15)2]+ [(1/3!)(20/15)3(45/(45-20))] ] = 1 / [1 + 4/3 + 8/9 + 32/45] = 15/59
86 Two-Lanes Stop-Sign Intersection Cost of Three Servers (continued) Thus, L = /30 = Total Cost = (20)(3) + 30(1.4780) = $ per hour
87 Two-Lanes Stop-Sign Intersection System Cost Comparison Mainten. Waiting Total Cost/min Cost/min Cost/min 2 Lanes $40.00 $82.00 $ Lanes Thus, the cost of having 3 lanes is less than that of 2 lanes
88 Queueing Models Can Be Essential in Analysis of Capital Investments Cost Total cost Optimal cost Cost of building the capacity Cost of losses due to waiting Optimal capacity Capacity
89 Extensions and Variations M/M/m, FCFS with a finite queue capacity m (cont d) The above equation turns out to be the exact same expression for Pn of M/G/m systems with k=m Variations and extensions of B&D queuing systems Most common is arrival rates and service rates that depend on the state of the system = c n n = d n n n=0,1,2,. n=0,1,2,. Some (not all) lead to closed-form expressions
90 Extensions and Variations Variations and extensions of B&D queuing systems Often-observed phenomena Balking: after arriving and observing the state of the system, a prospective customer will decide to not wait and go elsewhere Reneging: those who already joined the queue become discouraged after a while and leave without obtaining service Speed-up: by human operators whenever queues grow very long
91 M/G/1 Queuing System Spatially Distributed Queues When arrivals and service occur at different locations e.g. Ambulance for an EMF Calls arrive at the dispatch desk, according to a Poisson Process The ambulance spends a time Z at the location Service time is the summation of travel time and time on the scene
92 Queuing Systems with Priorities So far we have been focused on systems with FCFS (i.e. FIFO) and computed the 4 values E[L], E[W], E[L q ] and E[W q ] for this regime For example, a calling center with one operator might be interested in choosing one of the following queuing disciplines FCFS LIFO SIRO It can be shown that E[W FIFO ] = E[W LIFO ] = E[W SIRO ] (why?) The same is true for E[L], E[L q ] and E[W q ] (why?)
93 Queuing Systems with Failures Traffic Lights Example, 95 Cycle Time Fig. 1 North-South Direction (70 seconds) During the first 45 seconds (Fig 1) During the second 25 seconds (Fig 2) Fig. 2 Easterly Direction (25 seconds) [Fig 3] Fig. 3
94 Queuing Systems with Failures Traffic Lights Example, We have 6 independent U/D/1 queuing processes a uniform arrival rate deterministic service rate one server (lane) for each direction one queue (approaching vehicles from one lane) Services are interrupted by traffic lights cycles. We can assume this as a server 75% 25% 50% 50% failure 60% 40% Queuing processes are independent, while server cycles are dependent Failure of one server (red lights) signals another server to be ready (green lights)
95 Queuing Systems with Failures 45 seconds 25 seconds 25 seconds Server 1, South (S) Up Up Down Server 2, SouthEast (SE) Down Up Down Server 3, North (N) Up Down Down Server 4, NorthEast (NE) Up Up Up Server 5, WestNorth (WN) Up Up Up Server 6, WestSouth (WS) Down Down Up Server Queue S SE WN WS N NE
96 Word-processing support system A department has one word-processor operator. Documents produced in the department are delivered for word processing according to a Poisson process with an expected interarrival time of 20 minutes. When the operator has just one document to process, the expected processing time is 15 minutes. When she has more than one document, then editing assistance that is available reduces the expected processing time for each document to 10 minutes. In both cases, the processing times have an exponential distribution - draw the steady-state diagram for this queuing system - Find the steady state distribution of the number of documents that the operator has received but not yet processed - Derive L, Lq, W, Wq for this queuing system
97 Word-processing support system Answer P P 0 P P P 0... P n 3 6 P 1 n1 2 n1 3 4 P 0
98 Word-processing support system Answer 1 P n n P 0 P 1 P 2... P n 1 P P P n P 0 1 P P P P P 0 P 0 2 5
99 Word-processing support system Answer P 0 2 5, P , P n n steady state i : documents have Let P i been received but not yet completed P 0 P0 P P n Pn n,n 1 2
100 Word-processing support system Answer L np n 0.P n 0 L L L
101 Word-processing support system Answer W L L q n 1P n L 1 P n1 W q L q
Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More information5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.
The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines
More informationQueuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.
Queuing Theory Introduction Waiting lines are the most frequently encountered problems in everyday life. For example, queue at a cafeteria, library, bank, etc. Common to all of these cases are the arrivals
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationSystems Simulation Chapter 6: Queuing Models
Systems Simulation Chapter 6: Queuing Models Fatih Cavdur fatihcavdur@uludag.edu.tr April 2, 2014 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationClassification of Queuing Models
Classification of Queuing Models Generally Queuing models may be completely specified in the following symbol form:(a/b/c):(d/e)where a = Probability law for the arrival(or inter arrival)time, b = Probability
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationQueueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
More informationQueueing Theory. VK Room: M Last updated: October 17, 2013.
Queueing Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 17, 2013. 1 / 63 Overview Description of Queueing Processes The Single Server Markovian Queue Multi Server
More informationWaiting Line Models: Queuing Theory Basics. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1
Waiting Line Models: Queuing Theory Basics Cuantitativos M. En C. Eduardo Bustos Farias 1 Agenda Queuing system structure Performance measures Components of queuing systems Arrival process Service process
More informationIntroduction to Queueing Theory with Applications to Air Transportation Systems
Introduction to Queueing Theory with Applications to Air Transportation Systems John Shortle George Mason University February 28, 2018 Outline Why stochastic models matter M/M/1 queue Little s law Priority
More informationNetworking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013
Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah
More informationIOE 202: lectures 11 and 12 outline
IOE 202: lectures 11 and 12 outline Announcements Last time... Queueing models intro Performance characteristics of a queueing system Steady state analysis of an M/M/1 queueing system Other queueing systems,
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationThe effect of probabilities of departure with time in a bank
International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper
More informationChapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines.
Chapter 10 Queuing Systems D. 10. 1. (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines. D. 10.. (Queuing System) A ueuing system consists of 1. a user source.
More informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationQueuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if
1 Queuing Theory 3. Birth-Death Process Law of Motion Flow balance equations Steady-state probabilities: c j = λ 0λ 1...λ j 1 µ 1 µ 2...µ j π 0 = 1 1+ j=1 c j, if j=1 c j is finite. π j = c j π 0 Example
More informationReview of Queuing Models
Review of Queuing Models Recitation, Apr. 1st Guillaume Roels 15.763J Manufacturing System and Supply Chain Design http://michael.toren.net/slides/ipqueue/slide001.html 2005 Guillaume Roels Outline Overview,
More informationCourse Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design
Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Speed Studies - Project Traffic Queuing Intersections Level of Service in Highways and
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 24 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/6/16 2 / 24 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings
More informationQueueing Theory and Simulation. Introduction
Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan
More informationExercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems
Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationName of the Student:
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Part A questions REGULATION : R2013 UPDATED ON : November 2017 (Upto N/D 2017 QP) (Scan the above QR code for the direct
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationQueuing Theory. Using the Math. Management Science
Queuing Theory Using the Math 1 Markov Processes (Chains) A process consisting of a countable sequence of stages, that can be judged at each stage to fall into future states independent of how the process
More informationOutline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.
Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]
More informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationSince D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.
IEOR 46: Introduction to Operations Research: Stochastic Models Chapters 5-6 in Ross, Thursday, April, 4:5-5:35pm SOLUTIONS to Second Midterm Exam, Spring 9, Open Book: but only the Ross textbook, the
More informationQueuing Theory. Queuing Theory. Fatih Cavdur April 27, 2015
Queuing Theory Fatih Cavdur fatihcavdur@uludag.edu.tr April 27, 2015 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical model is the single-server
More informationChapter 1. Introduction. 1.1 Stochastic process
Chapter 1 Introduction Process is a phenomenon that takes place in time. In many practical situations, the result of a process at any time may not be certain. Such a process is called a stochastic process.
More informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationKendall notation. PASTA theorem Basics of M/M/1 queue
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue 1 History of queueing theory An old research area Started in 1909, by Agner Erlang (to model the Copenhagen
More informationReadings: Finish Section 5.2
LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationThe Queue Inference Engine and the Psychology of Queueing. ESD.86 Spring 2007 Richard C. Larson
The Queue Inference Engine and the Psychology of Queueing ESD.86 Spring 2007 Richard C. Larson Part 1 The Queue Inference Engine QIE Queue Inference Engine (QIE) Boston area ATMs: reams of data Standard
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
More informationAn M/M/1/N Queuing system with Encouraged Arrivals
Global Journal of Pure and Applied Mathematics. ISS 0973-1768 Volume 13, umber 7 (2017), pp. 3443-3453 Research India Publications http://www.ripublication.com An M/M/1/ Queuing system with Encouraged
More informationSandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue
Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue Final project for ISYE 680: Queuing systems and Applications Hongtan Sun May 5, 05 Introduction As
More informationM/G/1 and M/G/1/K systems
M/G/1 and M/G/1/K systems Dmitri A. Moltchanov dmitri.moltchanov@tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded
More informationChapter 2 Queueing Theory and Simulation
Chapter 2 Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University,
More informationIntroduction to queuing theory
Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave
More informationChapter 5: Special Types of Queuing Models
Chapter 5: Special Types of Queuing Models Some General Queueing Models Discouraged Arrivals Impatient Arrivals Bulk Service and Bulk Arrivals OR37-Dr.Khalid Al-Nowibet 1 5.1 General Queueing Models 1.
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 30-1 Overview Queueing Notation
More informationI, A BRIEF REVIEW ON INFINITE QUEUE MODEL M.
A BRIEF REVIEW ON INFINITE QUEUE MODEL M. Vasuki*, A. Dinesh Kumar** & G. Vijayaprabha** * Assistant Professor, Department of Mathematics, Srinivasan College of Arts and Science, Perambalur, Tamilnadu
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationSYMBOLS AND ABBREVIATIONS
APPENDIX A SYMBOLS AND ABBREVIATIONS This appendix contains definitions of common symbols and abbreviations used frequently and consistently throughout the text. Symbols that are used only occasionally
More informationEE 368. Weeks 3 (Notes)
EE 368 Weeks 3 (Notes) 1 State of a Queuing System State: Set of parameters that describe the condition of the system at a point in time. Why do we need it? Average size of Queue Average waiting time How
More informationEngineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 2262 MATERIAL NAME : University Questions MATERIAL CODE : SKMA104 UPDATED ON : May June 2013 Name of the Student: Branch: Unit I (Random Variables)
More informationAnswers to selected exercises
Answers to selected exercises A First Course in Stochastic Models, Henk C. Tijms 1.1 ( ) 1.2 (a) Let waiting time if passengers already arrived,. Then,, (b) { (c) Long-run fraction for is (d) Let waiting
More informationPart II: continuous time Markov chain (CTMC)
Part II: continuous time Markov chain (CTMC) Continuous time discrete state Markov process Definition (Markovian property) X(t) is a CTMC, if for any n and any sequence t 1
More informationINDEX. production, see Applications, manufacturing
INDEX Absorbing barriers, 103 Ample service, see Service, ample Analyticity, of generating functions, 100, 127 Anderson Darling (AD) test, 411 Aperiodic state, 37 Applications, 2, 3 aircraft, 3 airline
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More information(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?
IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-11/
More informationMULTIPLE CHOICE QUESTIONS DECISION SCIENCE
MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects
More information10.2 For the system in 10.1, find the following statistics for population 1 and 2. For populations 2, find: Lq, Ls, L, Wq, Ws, W, Wq 0 and SL.
Bibliography Asmussen, S. (2003). Applied probability and queues (2nd ed). New York: Springer. Baccelli, F., & Bremaud, P. (2003). Elements of queueing theory: Palm martingale calculus and stochastic recurrences
More informationPerformance Modelling of Computer Systems
Performance Modelling of Computer Systems Mirco Tribastone Institut für Informatik Ludwig-Maximilians-Universität München Fundamentals of Queueing Theory Tribastone (IFI LMU) Performance Modelling of Computer
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationλ λ λ In-class problems
In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationElementary queueing system
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue M/M/1 with preemptive-resume priority M/M/1 with non-preemptive priority 1 History of queueing theory An old
More informationComputer Systems Modelling
Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Michaelmas Term 2003 R. J. Gibbens Problem sheet William Gates Building JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/
More informationName of the Student: Problems on Discrete & Continuous R.Vs
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Additional Problems MATERIAL CODE : JM08AM1004 REGULATION : R2013 UPDATED ON : March 2015 (Scan the above Q.R code for
More informationQuiz Queue II. III. ( ) ( ) =1.3333
Quiz Queue UMJ, a mail-order company, receives calls to place orders at an average of 7.5 minutes intervals. UMJ hires one operator and can handle each call in about every 5 minutes on average. The inter-arrival
More informationClassical Queueing Models.
Sergey Zeltyn January 2005 STAT 99. Service Engineering. The Wharton School. University of Pennsylvania. Based on: Classical Queueing Models. Mandelbaum A. Service Engineering course, Technion. http://iew3.technion.ac.il/serveng2005w
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationSection 1.2: A Single Server Queue
Section 12: A Single Server Queue Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 12: A Single Server Queue 1/ 30 Section
More informationYORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)
YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS Instructor : Dr. Igor Poliakov MATH 4570 6.0, YEAR 2006-07 APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS) March 29, 2007 Name (print)
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More information4.7 Finite Population Source Model
Characteristics 1. Arrival Process R independent Source All sources are identical Interarrival time is exponential with rate for each source No arrivals if all sources are in the system. OR372-Dr.Khalid
More informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More informationPart I Stochastic variables and Markov chains
Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)
More informationSOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012
SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012 This exam is closed book. YOU NEED TO SHOW YOUR WORK. Honor Code: Students are expected to behave honorably, following the accepted
More informationGeneration of Discrete Random variables
Simulation Simulation is the imitation of the operation of a realworld process or system over time. The act of simulating something first requires that a model be developed; this model represents the key
More informationWaiting Time Analysis of A Single Server Queue in an Out- Patient Clinic
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 54-58 www.iosrjournals.org Waiting Time Analysis of A Single Server Queue in
More informationLecture Notes 7 Random Processes. Markov Processes Markov Chains. Random Processes
Lecture Notes 7 Random Processes Definition IID Processes Bernoulli Process Binomial Counting Process Interarrival Time Process Markov Processes Markov Chains Classification of States Steady State Probabilities
More informationQueueing. Chapter Continuous Time Markov Chains 2 CHAPTER 5. QUEUEING
2 CHAPTER 5. QUEUEING Chapter 5 Queueing Systems are often modeled by automata, and discrete events are transitions from one state to another. In this chapter we want to analyze such discrete events systems.
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Midterm Quiz April 6, 2010 There are 5 questions, each with several parts.
More information1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)
1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name
More informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationIntroduction to queuing theory
Introduction to queuing theory Claude Rigault ENST claude.rigault@enst.fr Introduction to Queuing theory 1 Outline The problem The number of clients in a system The client process Delay processes Loss
More informationCDA5530: Performance Models of Computers and Networks. Chapter 4: Elementary Queuing Theory
CDA5530: Performance Models of Computers and Networks Chapter 4: Elementary Queuing Theory Definition Queuing system: a buffer (waiting room), service facility (one or more servers) a scheduling policy
More informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
More informationAll models are wrong / inaccurate, but some are useful. George Box (Wikipedia). wkc/course/part2.pdf
PART II (3) Continuous Time Markov Chains : Theory and Examples -Pure Birth Process with Constant Rates -Pure Death Process -More on Birth-and-Death Process -Statistical Equilibrium (4) Introduction to
More information