Presentation is loading. Please wait.

Presentation is loading. Please wait.

Chapter 9 Queuing Models.

Similar presentations

Presentation on theme: "Chapter 9 Queuing Models."— Presentation transcript:

1 Chapter 9 Queuing Models

2 9.1 Introduction Queuing is the study of waiting lines, or queues.
The objective of queuing analysis is to design systems that enable organizations to perform optimally according to some criterion. Possible Criteria Maximum Profits. Desired Service Level.

3 9.1 Introduction Analyzing queuing systems requires a clear understanding of the appropriate service measurement. Possible service measurements Average time a customer spends in line. Average length of the waiting line. The probability that an arriving customer must wait for service.

4 9.2 Elements of the Queuing Process
A queuing system consists of three basic components: Arrivals: Customers arrive according to some arrival pattern. Waiting in a queue: Arriving customers may have to wait in one or more queues for service. Service: Customers receive service and leave the system.

5 The Arrival Process There are two possible types of arrival processes
Deterministic arrival process. Random arrival process. The random process is more common in businesses.

6 The Arrival Process Under three conditions the arrivals can be modeled as a Poisson process Orderliness : one customer, at most, will arrive during any time interval. Stationarity : for a given time frame, the probability of arrivals within a certain time interval is the same for all time intervals of equal length. Independence : the arrival of one customer has no influence on the arrival of another.

7 The Poisson Arrival Process
(lt)ke- lt k! P(X = k) = Where l = mean arrival rate per time unit. t = the length of the interval. e = (the base of the natural logarithm). k! = k (k -1) (k -2) (k -3) … (3) (2) (1).

8 HANK’s HARDWARE – Arrival Process
Customers arrive at Hank’s Hardware according to a Poisson distribution. Between 8:00 and 9:00 A.M. an average of 6 customers arrive at the store. What is the probability that k customers will arrive between 8:00 and 8:30 in the morning (k = 0, 1, 2,…)?

9 HANK’s HARDWARE – An illustration of the Poisson distribution.
Input to the Poisson distribution l = 6 customers per hour. t = 0.5 hour. lt = (6)(0.5) = 3. 1 2 3 4 5 6 7 8 k 1 2 3 (lt) e- lt k ! P(X = k )= 1 2 3 = 0! 1! 2! 3!

10 HANK’s HARDWARE – Using Excel for the Poisson probabilities
Solution We can use the POISSON function in Excel to determine Poisson probabilities. Point probability: P(X = k) = ? Use Poisson(k, lt, FALSE) Example: P(X = 0; lt = 3) = POISSON(0, 1.5, FALSE) Cumulative probability: P(X£k) = ? Example: P(X£3; lt = 3) = Poisson(3, 1.5, TRUE)

11 HANK’s HARDWARE – Excel Poisson

12 The Waiting Line Characteristics
Factors that influence the modeling of queues Line configuration Jockeying Balking Priority Tandem Queues Homogeneity

13 Line Configuration A single service queue.
Multiple service queue with single waiting line. Multiple service queue with multiple waiting lines. Tandem queue (multistage service system).

14 Jockeying and Balking Jockeying occurs when customers switch lines once they perceived that another line is moving faster. Balking occurs if customers avoid joining the line when they perceive the line to be too long.

15 Priority Rules These rules select the next customer for service.
There are several commonly used rules: First come first served (FCFS). Last come first served (LCFS). Estimated service time. Random selection of customers for service.

16 Tandem Queues These are multi-server systems.
A customer needs to visit several service stations (usually in a distinct order) to complete the service process. Examples Patients in an emergency room. Passengers prepare for the next flight.

17 Homogeneity A homogeneous customer population is one in which customers require essentially the same type of service. A non-homogeneous customer population is one in which customers can be categorized according to: Different arrival patterns Different service treatments.

18 The Service Process In most business situations, service time varies widely among customers. When service time varies, it is treated as a random variable. The exponential probability distribution is used sometimes to model customer service time.

19 The Exponential Service Time Distribution
f(t) = me-mt m = the average number of customers who can be served per time period. Therefore, 1/m = the mean service time. The probability that the service time X is less than some “t.” P(X £ t) = 1 - e-mt

20 Schematic illustration of the exponential distribution
The probability that service is completed within t time units P(X £ t) = 1 - e-mt X = t

21 HANK’s HARDWARE – Service time
Hank’s estimates the average service time to be 1/m = 4 minutes per customer. Service time follows an exponential distribution. What is the probability that it will take less than 3 minutes to serve the next customer?

22 Using Excel for the Exponential Probabilities
We can use the EXPDIST function in Excel to determine exponential probabilities. Probability density: f(t) = ? Use EXPONDIST(t, m, FALSE) Cumulative probability: P(X£k) = ? Use EXPONDIST(t, m, TRUE)

23 HANK’s HARDWARE – Using Excel for the Exponential Probabilities
The mean number of customers served per minute is ¼ = ¼(60) = 15 customers per hour. P(X < .05 hours) = 1 – e-(15)(.05) = ? From Excel we have: EXPONDIST(.05,15,TRUE) = .5276 3 minutes = .05 hours

24 HANK’s HARDWARE – Using Excel for the Exponential Probabilities

25 The Exponential Distribution - Characteristics
The memoryless property. No additional information about the time left for the completion of a service, is gained by recording the time elapsed since the service started. For Hank’s, the probability of completing a service within the next 3 minutes is ( ) independent of how long the customer has been served already. The Exponential and the Poisson distributions are related to one another. If customer arrivals follow a Poisson distribution with mean rate l, their interarrival times are exponentially distributed with mean time 1/l.

26 9.3 Performance Measures of Queuing System
Performance can be measured by focusing on: Customers in queue. Customers in the system. Performance is measured for a system in steady state.

27 9.3 Performance Measures of Queuing System
The transient period occurs at the initial time of operation. Initial transient behavior is not indicative of long run performance. n Roughly, this is a transient period… Time

28 9.3 Performance Measures of Queuing System
The steady state period follows the transient period. n This is a steady state period……….. Roughly, this is a transient period… Meaningful long run performance measures can be calculated for the system when in steady state. Time

29 9.3 Performance Measures of Queuing System
In order to achieve steady state, the effective arrival rate must be less than the sum of the effective service rates . k servers l< m For one server l< m1 +m2+…+mk For k servers with service rates mi l< km Each with service rate of m

30 Example : Suppose You will
customers arrrive at the rate of =20 per hour there are 3 servers, each serving an average of 4 customers per hour You will serve an average of 12 customers per hour add 8 customers each hour to your waiting line

31 Steady State Performance Measures
P0 = Probability that there are no customers in the system. Pn = Probability that there are “n” customers in the system. L = Average number of customers in the system. Lq = Average number of customers in the queue. W = Average time a customer spends in the system. Wq = Average time a customer spends in the queue. Pw = Probability that an arriving customer must wait for service. r = Utilization rate for each server (the percentage of time that each server is busy).

32 For the case of an infinite population
Little’s Formulas Little’s Formulas represent important relationships between L, Lq, W, and Wq. These formulas apply to systems that meet the following conditions: Single queue systems, Customers arrive at a finite arrival rate l, and The system operates under a steady state condition. L = l W Lq = l Wq L = Lq + l/m For the case of an infinite population

33 Classification of Queues
Queuing system can be classified by: Arrival process. Service process. Number of servers. System size (infinite/finite waiting line). Population size. Notation M (Markovian) = Poisson arrivals or exponential service time. D (Deterministic) = Constant arrival rate or service time. G (General) = General probability for arrivals or service time. Example: M / M / 6 / 10 / 20

34 9.4 M/M/1 Queuing System - Assumptions
Poisson arrival process. Exponential service time distribution. A single server. Potentially infinite queue. An infinite population.

35 M / M /1 Queue - Performance Measures
P0 = 1 – (l/m) Pn = [1 – (l/m)](l/m)n L = l /(m – l) Lq = l2 /[m(m – l)] W = 1 /(m – l) Wq = l /[m(m – l)] Pw = l / m r = l / m The probability that a customer waits in the system more than “t” is P(X>t) = e-(m - l)t

36 MARY’s SHOES Customers arrive at Mary’s Shoes every 12 minutes on the average, according to a Poisson process. Service time is exponentially distributed with an average of 8 minutes per customer. Management is interested in determining the performance measures for this service system.

37 MARY’s SHOES - Solution
Input l = 1/12 customers per minute = 60/12 = 5 per hour. m = 1/ 8 customers per minute = 60/ 8 = 7.5 per hour. Performance Calculations Pw = l/m = r = l/m = P(X<10min) = 1 – e-2.5(10/60) = .565 m –l = 7.5 – 5 = 2.5 per hr. P0 = 1 - (l/m) = 1 - (5/7.5) = Pn = [1 - (l/m)](l/m)n = (0.3333)(0.6667)n L = l/(m - l) = 2 Lq = l2/[m(m - l)] = W = 1/(m - l) = 0.4 hours = 24 minutes Wq = l/[m(m - l)] = hours = 16 minutes

38 Why is L - Lq = and not 1 ? 1/3 of the time : no customers are present and thus you serve 0 customer 2/3 of the time : one or more customers are present and you serve 1 customer the weighted average number of customers being served is : x (0) x (1) =

39 Relationship between System and Queue Performance measures
Average time in system = Average time in queue+ Average service time W = Wq +1/ 24 = minutes

40 Relationship between System and Queue Performance measures
Average number of customers in system = Average number of customers in queue + Average number of customers being served L = Lq +/ 2 = (5/7.5)

41 Customer waiting time in the system follows an exponential distribution with an average rate of
( -) = = 2.5 per hour The probability that a customer will wait less than 10 or 20 minutes is : P<10 min = 1 - e- 2.5 X (10/60) = 0.341 P<20 min = 1 - e- 2.5 X (20/60) = 0.565

42 ( -) = 9 - 5 = 4 per hour P<10 min = 1 - e- 4 X (10/60) = 0.487
If µ would be 9 per hour, customer waiting time in the system would follow an exponential distribution with an new average rate of ( -) = = 4 per hour The probability that a customer will wait less than 10 or 20 minutes is : P<10 min = 1 - e- 4 X (10/60) = 0.487 P<20 min = 1 - e- 4 X (20/60) = 0.736

43 m l WINQSB Input Screen

44 Performance Measurements


46 12.5 M/M/k Queuing Systems Characteristics
Customers arrive according to a Poisson process at a mean rate l. Service times follow an exponential distribution. There are k servers, each of who works at a rate of m customers (with km> l). Infinite population, and possibly infinite line.

47 M / M /k Queue - Performance Measures

48 M / M /k Queue - Performance Measures
The performance measurements L, Lq, Wq,, can be obtained from Little’s formulas.

Little Town post office is open on Saturdays between 9:00 a.m. and 1:00 p.m. Data On the average 100 customers per hour visit the office during that period. Three clerks are on duty. Each service takes 1.5 minutes on the average. Poisson and Exponential distributions describe the arrival and the service processes respectively.

The Postmaster needs to know the relevant service measures in order to: Evaluate the current service level. Study the effects of reducing the staff by one clerk.

This is an M / M / 3 queuing system. Input l = 100 customers per hour. m = 40 customers per hour (60/1.5). Does steady state exist (l < km )? l = 100 < km = 3(40) = 120.

52 LITTLE TOWN POST OFFICE – solution continued
First P0 is found by P0 is used now to determine all the other performance measures.

53 LITTLE TOWN POST OFFICE – Spreadsheet Solution

54 9.6 M/G/1 Queuing System Assumptions
Customers arrive according to a Poisson process with a mean rate l. Service time has a general distribution with mean rate m. One server. Infinite population, and possibly infinite line.

55 Pollaczek - Khintchine Formula for L
With  = standard deviation of the service time Note: It is not necessary to know the particular service time distribution. Only the mean and standard deviation of the distribution are needed.

56 TED’S TV REPAIR SHOP Ted’s repairs television sets and VCRs. Data
It takes an average of 2.25 hours to repair a set. Standard deviation of the repair time is 45 minutes. Customers arrive at the shop once every 2.5 hours on the average, according to a Poisson process. Ted works 9 hours a day, and has no help. He considers purchasing a new piece of equipment. New average repair time is expected to be 2 hours. New standard deviation is expected to be 40 minutes.

57 TED’S TV REPAIR SHOP Ted wants to know the effects of using the new
equipment on – 1. The average number of sets waiting for repair; 2. The average time a customer has to wait to get his repaired set.

58 TED’S TV REPAIR SHOP - Solution
This is an M/G/1 system (service time is not exponential (note that s ¹ 1/m). Input The current system (without the new equipment) l = 1/ 2.5 = 0.4 customers per hour. m = 1/ 2.25 = costumers per hour. s = 45/ 60 = 0.75 hours. The new system (with the new equipment) m = 1/2 = 0.5 customers per hour. s = 40/ 60 = hours.

59 9.7 M / M / k / F Queuing System
Many times queuing systems have designs that limit their line size. When the potential queue is large, an infinite queue model gives accurate results, even though the queue might be limited. When the potential queue is small, the limited line must be accounted for in the model.

60 Characteristics of M/M/k/F Queuing System
Poisson arrival process at mean rate l. k servers, each having an exponential service time with mean rate m. Maximum number of customers that can be present in the system at any one time is “F”. Customers are blocked (and never return) if the system is full.

61 M/M/k/F Queuing System – Effective Arrival Rate
A customer is blocked if the system is full. The probability that the system is full is PF (100PF% of the arriving customers do not enter the system). The effective arrival rate = the rate of arrivals that make it through into the system (le). le = l(1 - PF)

62 RYAN ROOFING COMPANY Ryan gets most of its business from customers who call and order service. When a telephone line is available but the secretary is busy serving a customer, a new calling customer is willing to wait until the secretary becomes available. When all the lines are busy, a new calling customer gets a busy signal and calls a competitor.

Arrival process is Poisson, and service process is Exponential. Each phone call takes 3 minutes on the average. 10 customers per hour call the company on the average. One appointment secretary takes phone calls from 3 telephone lines.

64 RYAN ROOFING COMPANY Management would like to design the following system: The fewest lines necessary. At most 2% of all callers get a busy signal. Management is interested in the following information: The percentage of time the secretary is busy. The average number of customers kept on hold. The average time a customer is kept on hold. The actual percentage of callers who encounter a busy signal.

This is an M/M/1/3 system Input l = 10 per hour. m = 20 per hour (1/3 per minute). Excel spreadsheet gives: P0 = 0.533, P1 = 0.133, P3 = 0.06 6.7% of the customers get a busy signal. This is above the goal of 2%. M/M/1/5 system M/M/1/4 system See spreadsheet next P0 = 0.516, P1 = 0.258, P2 = 0.129, P3 = 0.065, P4 = 0.032 3.2% of the customers get the busy signal Still above the goal of 2% P0 = 0.508, P1 = 0.254, P2 = 0.127, P3 = 0.063, P4 = 0.032 P5 = 0.016 1.6% of the customers get the busy signal The goal of 2% has been achieved.

66 RYAN ROOFING COMPANY - Spreadsheet Solution

67 12.8 M / M / 1 / / m Queuing Systems
In this system the number of potential customers is finite and relatively small. As a result, the number of customers already in the system affects the rate of arrivals of the remaining customers. Characteristics A single server. Exponential service time, Poisson arrival process. A population size of a (finite) m customers.

68 PACESETTER HOMES Pacesetter Homes runs four different development projects. Data At each site running a project is interrupted once every 20 working days on the average. The V.P. for construction handles each stoppage. How long on the average a site is non-operational? If it takes 2 days on the average to restart a project’s progress (the V.P. is using the current car). If it takes days on the average to restart a project’s progress (the V.P. is using a new car)

This is an M/M/1//4 system, where: The four sites are the four customers. The V.P. for construction is the server. Input l = (1/20) m = m = 0.533 (1/2 days, using the current car) (1/1.875 days, using a new car).

70 PACESETTER HOMES – Solution continued
Summary of results

71 PACESETTER HOMES – Spreadsheet Solution

72 9.9 Economic Analysis of Queuing Systems
The performance measures previously developed are used next to determine a minimal cost queuing system. The procedure requires estimated costs such as: Hourly cost per server . Customer goodwill cost while waiting in line. Customer goodwill cost while being served.

Wilson Foods has an 800 number to answer customers’ questions. If all the customer representatives are busy when a new customer calls, he/she is asked to stay on the line. A customer stays on the line if the waiting time is not longer than 3 minutes.

Data On the average 225 calls per hour are received. An average phone call takes 1.5 minutes. A customer will stay on the line waiting at most 3 minutes. A customer service representative is paid $16 per hour. Wilson pays the telephone company $0.18 per minute when the customer is on hold or when being served. Customer goodwill cost is $20 per minute while on hold. Customer goodwill cost while in service is $0.05. How many customer service representatives should be used to minimize the hourly cost of operation?

75 WILSON FOODS – Solution
The total hourly cost model Average hourly goodwill cost for customers on hold Total hourly wages TC(K) = Cwk + CtL + gwLq + gs(L - Lq) Total average hourly Telephone charge Average hourly goodwill cost for customers in service TC(K) = Cwk + (Ct + gs)Lq + (Ct + gs)(L – Lq)

76 WILSON FOODS – Solution continued
Input Cw= $16 Ct = $10.80 per hour [0.18(60)] gw= $12 per hour [0.20(60)] gs = $3 per hour [0.05(60)] The Total Average Hourly Cost = TC(K) = 16K + (10.8+3)L + (12 - 3)Lq = 16K L + 9Lq

77 WILSON FOODS – Solution continued
Assuming a Poisson arrival process and an Exponential service time, we have an M/M/K system. l = 225 calls per hour. m = 40 per hour (60/1.5). The minimal possible value for K is 6 to ensure that steady state exists (l<Km). Excel MMk worksheet was used to generate results for L, Lq, and Wq.

78 WILSON FOODS – Solution continued
Summary of results of the runs for k=6,7,8,9,10 Conclusion: employ 8 customer service representatives.

79 WILSON FOODS – Spreadsheet Solution

Hargrove Hospital is experiencing cutbacks, and is trying to reorganize operations to reduce operating costs. There is a trade off between the costs of operating more birthing stations and the costs of rescheduling surgeries in the surgery room when women give birth there, if all the birthing stations are occupied. The hospital wants to determine the optimal number of birthing stations that will minimize operating costs.

Data Cutting one birthing station saves $25,000 per year. Building a birthing station costs $30,000. Maternity in the surgery room costs $400 per hour. Six women on the average need a birthing station a day. The arrival process is Poisson. Every birthing process occupies a birthing station for two hours on the average.

82 HARGROVE HOSPITAL Solution Analysis of the current situation
Currently there are two birthing stations The current problem can be modeled as a M/G/2/2 queuing system. Using the MGkk Excel worksheet with l = 6 and m = 12/day we have: r = W = days Pw = L = P0 = .6154 7.7% of the arriving women are sent to the surgery room to give birth.

83 HARGROVE HOSPITAL Solution – continued
The birthing stations problem can be modeled as a M/G/k/k queuing model. Input l = 6 women per day; m = 12 women per day (24/2); k = the number of birthing stations used The total cost for the hospital is TC(k) = Cost of using the surgery room for maternity + Additional cost of operating k stations

84 HARGROVE HOSPITAL Solution – continued
Average daily cost of using the surgery room for maternity: Pk(l)(average time in the surgery room)(hourly cost) Average additional daily cost of operating k stations 25,000/365 = $68.49 per day. Average daily total cost TC(k) = Pk(l)(24/m)(Hourly cost) k = Pk(6)(24/12)(400) k = 4800Pk k

From repeated runs of the MGkk worksheet to determine Pk we got the following results: k Pk $4800Pk Additional Cost of stations Total net average Daily cost 1 2 3 4 $1,600 369.23 60.76 7.58 $ – 68.49 82.19 163.38 $1,531.51 364.23 142.95 171.96 Current Optimal

86 HARGROVE HOSPITAL – Spreadsheet Solution

87 9.10 Tandem Queuing Systems
In a Tandem Queuing System a customer must visit several different servers before service is completed. Beverage Meats Examples All-You-Can-Eat restaurant

88 9.10 Tandem Queuing Systems
In a Tandem Queuing System a customer must visit several different servers before service is completed. Meats Beverage Examples All-You-Can-Eat restaurant

89 9.10 Tandem Queuing Systems
In a Tandem Queuing System a customer must visit several different servers before service is completed. Meats Beverage Examples All-You-Can-Eat restaurant A drive-in restaurant, where first you place your order, then pay and receive it in the next window. A multiple stage assembly line.

90 9.10 Tandem Queuing Systems
For cases in which customers arrive according to a Poisson process and service time in each station is exponential, …. Total Average Time in the System = Sum of all average times at the individual stations

91 BIG BOYS SOUND, INC. Big Boys sells audio merchandise.
The sale process is as follows: A customer places an order with a sales person. The customer goes to the cashier station to pay for the order. After paying, the customer is sent to the pickup desk to obtain the good.

92 BIG BOYS SOUND, INC. Data for a regular Saturday Personnel.
8 sales persons are on the job. 3 cashiers. 2 workers in the merchandise pickup area. Average service times. Average time a sales person waits on a customer is 10 minutes. Average time required for the payment process is 3 minutes. Average time in the pickup area is 2 minutes. Distributions. Exponential service time at all the service stations. Poisson arrival with a rate of 40 customers an hour.

93 BIG BOYS SOUND, INC. Only 75% of the arriving customers make a purchase! What is the average amount of time, a customer who makes a purchase spends in the store?

94 BIG BOYS SOUND, INC. – Solution
This is a Three Station Tandem Queuing System Pickup desk M / M / 2 (.75)(40)=30 Cashiers M / M / 3 l = 30 Sales Clerks M / M / 8 l = 30 W3 = 2.67 minutes l = 40 W2 = 3.47 minutes Total = minutes. W1 = 14 minutes

95 Appendix : Assembly Line Balancing
An Assembly Line can be thought of as a tandem queue, because a product visits several workstations in a given sequence. In a balanced assembly line the time spent in each of the different workstations is about the same. The objective is to maximize production throughput by allocating tasks to workstations

McMurray manufactures lawn mowers and snow blowers. The assembly operation of a certain mower consists of four workstations. The longest time spent at a workstation is 4 minutes. Thus, the maximum number of mowers that can be produced is 15 per hour. Management would like to increase productivity by better balancing the assembly line.

97 Data The entire operation takes 12 minutes Workstation 2 is a bottleneck.

98 Various options to balance the assembly line
SOLUTION Various options to balance the assembly line Try to schedule operations to take a total of three minutes in each station . Assign workers to workstations as needed to balance the station outputs. Assign multiple workstations to perform the operations.

99                      Work Station 1 Work
Work flow Workers Product

100 Use Integer and Dynamic Programming optimization techniques, to minimize the total amount of idle time at all workstations. Use an heuristic techniques such as “The Ranked Position Weight Technique,” to find the smallest number of workstations needed to meet a prespecified cycle time. (Although a heuristic solution does not guarantee optimality, this heuristic was found optimal in large number of applications.)

101 The Ranked Position Weight technique
1. For each task, find the total job time for all tasks for which that task is a predecessor. 2. Rank the jobs in descending order of these total times. 3. Consider workstation 1 the current workstation. 4. Assign the lowest ranked task to the current station provided the following conditions are met The task is not already assigned. The time at the current workstation (with the new task added) will not exceed the desired cycle time. 5. If the second condition in step 4 is not met, designate a new station as a current station, and assign the task there. 6. Repeat step 4 until all tasks have been assigned to workstations.

102 McMURRAY - continued Demand for the mower increased, and as a result the needed cycle time drops to 3 minutes in the assembly line. McMurray would like to balance the line using the smallest number of workstations.

103 Data Tasks Required to Manufacture a Lawn Mower


105 Step 1 and 2 Tasks sorted by ranks

106 Step 3 and 4 Actual cycle time = 170. This can be reduced to 160,
by moving “K” from station 4 to station 5.

Download ppt "Chapter 9 Queuing Models."

Similar presentations

Ads by Google