Waiting Lines and Queuing Theory Models

Size: px
Start display at page:

Download "Waiting Lines and Queuing Theory Models"

Transcription

1 1 5 Waiting Lines and Queuing Theory Models 5.1 Introduction Queuing theory is the study of waiting lines. It is one of the oldest and most widely used quantitative analysis techniques. Waiting lines are an everyday occurrence for most people. Queues form in business process as well. The three basic components of a queuing process are arrivals, service facilities, and the actual waiting line. Analytical models of waiting lines can help managers evaluate the cost and effectiveness of service systems. Most waiting line problems are focused on finding the ideal level of service a firm should provide. In most cases, this service level is something management can control. When an organization does have control, they often try to find the balance between two extremes. A large staff and many service facilities generally results in high levels of service but have high costs. Queuing costs and service level Having the minimum number of service facilities keeps service cost down but may result in dissatisfied customers. There is generally a trade-off between cost of providing service and cost of waiting time. Service facilities are evaluated on their total expected cost which is the sum of service costs and waiting costs. Organizations typically want to find the service level that minimizes the total expected cost. WORKED-OUT EXAMPLE (Render) 1: Three Rivers Shipping Company Three Rivers Shipping operates a docking facility on the Ohio River. An average of 5 ships arrives to unload their cargos each shift. Idle ships are expensive. More staff can be hired to unload the ships, but that is expensive as well. Three Rivers Shipping Company wants to determine the optimal number of teams of stevedores to employ each shift to obtain the minimum total expected cost. Three Rivers Shipping waiting line cost analysis NUMBER OF TEAMS OF STEVEDORES WORKING (a) Average number of ships arriving per shift (b) Average time each ship waits to be unloaded (hours) (c) Total ship hours lost per shift (a x b) (d) Estimated cost per hour of idle ship time $1,000 $1,000 $1,000 $1,000 (e) Value of ship s lost time or waiting cost (c x d) $35,000 $0,000 $15,000 $10,000 (f) Stevedore team salary or service cost $6,000 $1,000 $18,000 $4,000 (g) Total expected cost (e + f) $41,000 $3,000 $33,000 $34,000 There are three parts to a queuing system. These are : arrivals to the system, queue line itself and service facility. 1. Arrival Characteristics have three major characteristics, size, pattern, and behavior. a. Size of the calling population: Can be either unlimited (essentially infinite) or limited (finite). b. Pattern of arrivals: Can arrive according to a known pattern or can arrive randomly. Random arrivals generally follow a Poisson distribution.

2 The Poisson distribution is: where P(X) = probability of X arrivals X = number of arrivals per unit of time e X P( X) for X 0,1,,3, 4,... = average arrival rate X! e =.7183 WORKED-OUT EXAMPLE : The average arrival number is per hour. Find the probability of 0, 1, arrivals. Solution: =/hour e P(0) 0! e P(1) 1! 1 e P()! (1) % 1 e () % 1 1 e (4) % (1) These values can be found from Poisson distribution tables or in Excel it can be calculated. As increases the distribution approaches normal distribution. c. Behavior of arrivals: Most queuing models assume customers are patient and will wait in the queue until they are served and do not switch lines. Balking refers to customers who refuse to join the queue. Reneging customers enter the queue but become impatient and leave without receiving their service. That these behaviors exist is a strong argument for the use of queuing theory to managing waiting lines.. Waiting Line Characteristics: Waiting lines can be either limited or unlimited. Queue discipline refers to the rule by which customers in the line receive service. The most common rule is first-in, first-out (FIFO). 3. Service Facility Characteristics: Service systems are classified in terms of the number of channels, or servers, and the number of phases, or service stops. A single-channel system with one server is quite common. Multichannel systems exist when multiple servers are fed by one common waiting line. In a single-phase system the customer receives service form just one server. If a customer has to go through more than one server, it is a multiphase system. Four basic queuing system configurations

3 3 Service time distribution: Service patterns can be either constant or random. Constant service times are often machine controlled. More often, service times are randomly distributed according to a negative exponential probability distribution. Models are based on the assumption of particular probability distributions. D. G. Kendall developed a notation for queuing models that specifies the pattern of arrival, the service time distribution, and the number of channels. It is of the form Specific letters are used to represent probability distributions M = Poisson distribution for number of occurrences, D = constant (deterministic) rate, G = general distribution with known mean and variance. So a single channel model with Poisson arrivals and exponential service times would be represented by: M/M/1 If a second channel is added we would have: M/M/ A three channel system with Poisson arrivals and constant service time would be: M/D/3 A four channel system with Poisson arrivals and normally distributed service times would be: M/G/4 5. The M/M/1 Model (Poisson Arrivals, Exponential Service Times and Single-Channel Model) Assumptions of the model: Arrivals are served on a FIFO basis. No balking or reneging. Arrivals are independent of each other but rate is constant over time. Arrivals follow a Poisson distribution. Service times are variable and independent but the average is known. Service times follow a negative exponential distribution. Average service rate is greater than the average arrival rate. Queuing Equations We let =mean number of arrivals per time period = mean number of people or items served per time period The arrival rate and the service rate must be for the same time period. 1. The average number of customers or units in the system, L:. The average time a customer spends in the system, W: 3. The average number of customers in the queue, L q : 4. The average time a customer spends waiting in the queue, W q : 5. The utilization factor for the system,, the probability the service facility is being used: 6. The percent idle time, P 0, the probability no one is in the system : 7. The probability that the number of customers in the system is greater than k, P n>k : L s W 1 s L q ( ) W q ( ) P 0 1 P n k k1

4 4 WORKED-OUT EXAMPLE (Render) 3: Arnold s mechanic can install mufflers at a rate of 3 per hour. Customers arrive at a rate of per hour. Calculate the length of system (L s ), waiting time in system (W s ), length of queue (L q ), waiting time in queue (W q ), percentage of time mechanic is busy (), probability that there are 0 cars in the system (P 0 ), Solution: = cars arriving per hour, = 3 cars serviced per hour Ls Ws L q W q 3 1 ( ) 3(3 ) ( ) P Introducing costs into the model 4 3(1) hour percentage of time mechanic is busy 3 0 cars waiting in system on the average hour that an average car spends in the system cars waiting in line on the average average waiting time per car probability that there are 0 cars in the system Arnold wants to do an economic analysis of the queuing system and determine the waiting cost and service cost The total service cost = (Number of channels) x (Cost per channel) = m C s Total waiting cost = (Number of arrivals) x (Average wait per arrival) x(cost of waiting) = W C w So the total cost of the queuing system when based on time in the system is Total cost = Total service cost + Total waiting cost = mc s + WC w Arnold estimates the cost of customer waiting time in line is $10 per hour, so Total daily waiting cost = (8 hours per day)w q C w = (8)()( / 3 )($10) = $ Arnold has identified the mechanics wage $7 per hour as the service cost, so Total daily service cost= (8 hours per day)mc s = (8)(1)($7) = $56 So, Total daily cost of the queuing system = $ $56 = $16.67 Input data and formulas using Excel

5 5 WORKED-OUT EXAMPLE (Render) 4: Arnold is thinking about hiring a different mechanic who can install mufflers at a faster rate 4 cars per hour but the wage is 9$ per hour. The new operating characteristics would be = cars arriving per hour and = 4 cars serviced per hour. With the costs given in previous question calculate L, W, L q, W q,, P 0, daily waiting cost, daily service cost and total daily cost of the queuing system. Solution: L=1, W=1/, L q =1/, W q =1/4 hour=15 min, =0.5, P 0 =0.5, daily waiting cost=$40, daily service cost=$7, Total daily cost=$40+$7=$11 Follow up Exercises (M/M/1) 1. (Rama /9.1) A T.V. repairman finds that the time spent on his jobs have an exponential distribution with mean of 30 minutes. If he repairs sets in the order in which they come in, and if the arrival of sets is approximately Poisson with an average rate of 10 per 8 hour day, what is repairman s expected idle time each day? How many jobs are ahead of the average set just brought in? (Ans: =5/4; =; =0.65 so out of 8 hours 5 hours is busy; no queue P 0 =3/8; L s =5/3). (Rama /9.) The arrivals at a telephone booth are considered to be following Poisson law of distribution with an average time of 10 minutes between one arrival and the next. Length of the phone call is assumed to be distributed exponentially with a mean of 3 minutes. (a) What is the probability that a person arriving at the booth will have to wait? (b) What is the average length of queue that forms from time to time? (Ans: =0.1 per min; =0.33; =0.3; P o =0.7 so has to wait is 0.3; L s =1.43) 3. (Rama /9.3) In a departmental store one cashier is there to serve the customers. And the customers pick up their needs by themselves. The arrival rate is 9 customers for every 5 minutes and the cashier can serve 10 customers in 5 minutes. Assuming Poisson arrival rate and exponential distribution for service rate, find: (a) Average number of customers in the system. (b) Average number of customers in the queue or average queue length. (c) Average time a customer spends in the system. (d) Average time a customer waits before being served. (Ans: =1.8; =; =0.9; L s =9; W s =5 min; L q =8.1; W q =4.5 min.) 4. (Rama /9.4) A branch of a National bank has only one typist. Since typing work varies in length (number of pages to be typed), the typing rate is randomly distributed approximating a Poisson distribution with a mean service rate of 8 letters per hour. The letter arrives at a rate of 5 per hour during the entire 8- hour workday. If the typist is valued at $15 per hour, determine: (a) Equipment utilization, (b) The percent time an arriving letter has to wait, (c) Average system time, and (d) Average idle time cost of the typewriter per day. (Ans:=5 per hour ; =8 per hour; =0.65 ; Percent to wait = 0.65; W s =1/3 hours ; Cost of idle typewriter= $45 per day.) 5. (Rama /9.5)A product manufacturing plant at a city distributes its products by trucks, loaded at the factory warehouse. It has its own fleet of trucks plus trucks of a private transport company. This transport company has complained that sometimes its trucks have to wait in line and thus the company loses money paid for a truck and driver of waiting truck. The company has asked the plant manager either to go in for a second warehouse or discount prices equivalent to the waiting time. The data available is: Average arrival rate of all trucks 3 per hour. Average service rate is 4 per hour. Assuming that these rates are random according to Poisson distribution, determine: (a) The probability that a truck has to wait? (b) The waiting time of a truck that has to wait, (c) The expected waiting time of company trucks per day. (Ans:=3 per hour; =4 per hour; =3/4 ; W s =1 hour; company trucks have to wait 7 hours per day.)

6 6 6. (Rama /9.6) A repairman is to be hired to repair machines, which break down at an average rate of 3 per hour. The breakdown follows Poisson distribution. Non - productive time of a machine is considered to cost $ 16/- per hour. Two repairmen have been interviewed. One is slow but cheap while the other is fast but expensive. The slow worker charges $ 8/- per hour and the services breakdown machines at the rate of 4 per hour. The fast repairman demands $ 10/- per hour and services at an average rate of 6 per hour. Which repairman is to be hired? (Ans: slow worker cost $56, and fast worker cost is $6) 7. (Rama /9.7) There is a congestion of the platform of a railway station. The trains arrive at the rate of 30 trains per day. The waiting time for any train to hump is exponentially distributed with an average of 36 minutes. Calculate the mean queue size. (Ans: 30 trains per day =1/48, = 1/36,=0.75; L q =3 trains per minute) 8. (Rama /9.8) Let on the average 96 patients per 4-hour day require the service of an emergency clinic. Also on average, a patient requires 10 minutes of active attention. Assume that the facilities can handle only one emergency at a time. Suppose that it costs the clinic $ 100/- per patient treated to obtain an average servicing time of 10 minutes and that each minute of decrease in this average time would costs $10/- per patient treated. How much would have to be budgeted by the clinic to decrease the average size of the queue from one and one third patient to half a patient? (Ans: =4 patients per hour; =6 patients per hour; =/3 ; L s = 4/3 patients ; =8 patients per hour for L s =1/ and W s =7.5 min, Cost=(100+10*.5)=$15 ) 5.3 The M/M/s Model (Poisson Arrivals, Exponential Service Times and Multichannel Model) The M/M/s model is appropriate for analyzing queuing problems where the following assumptions are met: There are s servers, where s is a positive integer. Arrivals follow a Poisson distribution and occur at an average rate of per time period. Each server provides service at an average rate of per time period, and actual service times follow an exponential distribution. Arrivals wait in a single FIFO queue and are serviced by the first available server. < s WORKED-OUT EXAMPLE (Ragsdale) 5: The customer support hotline for Bitway Computers is currently staffed by a single technician. Calls arrive randomly at a rate of five per hour and follow a Poisson distribution. The technician can service calls at an average rate of seven per hour, but the actual time required to handle a given call is an exponential random variable. The president of Bitway, Rod Taylor, has received numerous complaints from customers about the length of time they must wait on hold for service when calling the hotline. Rod wants to determine the average length of time that customers currently wait before the technician answers their calls. If the average waiting time is more than five minutes, he wants to determine how many technicians would be, required to reduce the average waiting time to two minutes or less.

7 7 Solution: There is one server so this is indeed M/M/1. The value in cell F10 indicates that the average length of this wait is hours (or approximately 1.4 minutes). The value in cell F11 indicates that, on average, a caller spends a total of 0.5 hours (or 30 minutes) waiting for service and being served under Bitway s current hotline configuration. Thus, it appears that the customer complaints to Bitway s president are justifiable. The value in cell F1 indicates that, with two servers, the probability that a caller must wait before receiving service drops significantly from to Similarly, cell F10 indicates that the average amount of time a caller must wait before service begins drops to hours (or approximately 1.5 minutes). Thus, it seems that adding a second technician to the customer service hotline would achieve the two-minute average waiting time objective Rod wants. WORKED-OUT EXAMPLE (Render) 6: Arnold s mechanic can install mufflers at a rate of 3 per hour. Customers arrive at a rate of per hour. The wage is 9$ per hour and waiting cost is $10 per hour. OPERATING CHARACTERISTIC ONE MECHANIC = 3 TWO MECHANICS = 3 FOR BOTH Probability that the system is empty (P 0) Average number of cars in the system (L) cars 0.75 cars Average time spent in the system (W) 60 minutes.5 minutes Average number of cars in the queue (L q) 1.33 cars car Average time spent in the queue (W q) 40 minutes.5 minutes Calculate the operating cost for each alternative. Follow up Exercises (M/M/s) 1. (Ragsdale/13.9) On Friday nights, patients arrive at the emergency room at Mercy Hospital at an average rate of seven per hour, which follows a Poisson distribution. Assume that an emergency-room physician can treat an average of three patients per hour, and that the treatment times follow an exponential distribution. The board of directors for Mercy Hospital wants patients arriving at the emergency room to wait no more than five minutes before seeing a doctor. How many emergency-room doctors should be scheduled on Friday nights to achieve the hospital s objective? (Ans: =7, = 3,s=4 then W q = 3.3)

8 8. (Ragsdale/13.11) The Madrid Mist outlet store at Chiswell Mills sells discount luggage and does most of its daily business between 6 pm and 9 pm. During this time, customers arrive at the checkout desk at a rate of one every two minutes following a Poisson distribution. The checkout operation takes an average of three minutes per customer and can be approximated well by an exponential distribution. Madrid Mist s corporate policy is that customers should not have to wait longer than one minute to begin the checkout operation. a. What is the average service rate and arrival rate per minute? b. What would happen if the store operated a single checkout station during the time period in question? c. How many checkout stations should the store plan to operate during this time period to stay within the corporate policy on checkout operations? (Ans: =0.5, = 0.33,s= 3, W q = 0.49) 3. (Ragsdale/13.1) Interstate 81 through southwest Virginia is heavily traveled by long-distance truckers. To cut down on accidents, The Virginia State Patrol carries out random inspections of a truck s weight and the condition of its brakes. On Fridays, trucks approach the inspection station at a rate of one every 45 seconds following a Poisson process. The time required to check a truck s weight and brakes follows an exponential distribution with an average inspection time of 5 minutes. The state troopers only pull over trucks when at least one of their three portable inspection units is available. a. What is the probability that all three inspection units will be idle at the same time? b. What proportion of trucks traveling this section of Interstate 81 will be inspected? c. On average, how many trucks will be pulled over for inspection each hour? (Ans: =?, =?,s= 3, W q = ) 4. (Rama/9.18) A super market has two girls ringing up sales at the counters. If the service time from each customer is exponential with a mean of 4 minutes, and if people arrive in a Poisson fashion at the rate of 10 an hour, find what is the expected percentage of idle time for each girl? If the manager of the firm plans for the customers to have a waiting time of less than 5 minutes in a queue, is it enough to have 1 worker? (Ans: idle time=%67, for s=1 W q =8 so not enough) 5. (Rama/9.19) A tax-consulting firm has 3 counters in its office to receive people who have problems concerning their income, wealth and sales taxes. On the average 48 persons arrive in an 8- hour day. Each tax adviser spends 15 minutes on the average on an arrival. If the arrivals are Poisson distributed and service times are according to exponential distribution find: a. The average number of customers in the system, b. Average number of customers waiting to be serviced, c. Average time a customer spends in the system, d. Average waiting time for a customer, e. The number of hours each week a tax adviser spends performing his job, f. The expected number of idle tax advisers at any specified time. (Ans: L s =1.74, L q =0.4, W s =0.9 h=17.4 min, W q =0.04h=.4 min, 4 hours a day, idle servers=1.5) 6. (Rama/9.0) A telephone exchange has two long distance operators. The telephone company finds that during the peak load, long distance calls arrive in a Poisson fashion at an average rate of 15 per hour. The length of service on these calls is approximately exponentially distributed with mean length 5 minutes. What is the expected waiting time in queue? (Ans: W q = h=3. min) 7. (Rama/9.1) A bank has two tellers working on savings account. The first teller handles withdrawals only. The second teller handles deposits only. It has been found that the service time distribution for deposits and withdrawals both are exponentially with a mean service time of 3 minutes per customer. Depositors are found to arrive in a Poisson fashion throughout the day with a mean arrival rate of 16 per hour. Withdrawals also arrive in a Poisson fashion with a mean arrival rate of 14 per hour. What would be the effect on the average waiting time for depositors and withdrawers, if each teller could handle both withdrawals and deposits? What would be the effect of this could only be accomplished by increasing the services time to 3.5 minutes? (Ans: for depositors =1 min, for withdrawals= 7 min, W q =3.86 min.) 8. (Rama/9.) Ships arrive at a port at the rate of one in every 4 hours with exponential distribution of inter arrival times. The time a ship occupies a berth for unloading has exponential distribution with an average of 10 hours. If the average delay of ships waiting for berths is to be kept below 14 hours, how many berths should be provided at the port? (Ans: 4 berths)

9 9 5.3 The M/M/s Model with Finite Queue Length (M/M/s : K) In some situations, however, the size or capacity of the waiting area might be restricted in other words, there might be a finite queue length. The formulas describing the operating characteristics of an M/M/s queue with a finite queue length of K are summarized as follows: WORKED-OUT EXAMPLE 7: To see how this queuing model might be used, suppose that Bitway s telephone system (=5, =7) can keep a maximum of five calls on hold at any point in time. If a new call is made to the hotline when five calls are already in the queue, the new call receives a busy signal. Thus, Rod might want to investigate what effect adding a second technician to answer hotline calls would have on the number of calls receiving busy signals and on the average time callers must wait before receiving service. Solution: The value in cell F13 indicates that a probability exists that callers to Bitway s customer service hotline will balk (or, in this case, receive a busy signal). A balk refers to an arrival that does not join the queue because the queue is full or too long. The value in cell F10 indicates that the average length of this wait is 0.59 hours (or approximately minutes). The value in cell F11 indicates that, on average, a caller spends a total of hours (or.1 minutes) either waiting for service or being served under Bitway s current hotline configuration. The value in cell F13 indicates that, with two servers, the probability that a caller receives a busy signal drops to Similarly, cell F10 indicates that the average amount of time a caller must wait before service begins drops to hours (or approximately 1. minutes). Thus, it seems that adding a second technician to the customer service hotline would achieve the two-minute average waiting time objective Rod wants and would virtually eliminate any chance of a customer receiving a busy signal. Here again, Rod should consider weighing the costs of adding the additional support technician against the benefits of eliminating the chances of customers receiving busy signals when they call the customer support hotline.

10 10 Follow up Exercises (M/M/s : K) 1. (Rama/9.1) In a railway marshalling yard, trains arrive at the rate of 30 trains per day. Assume that the inter arrival time follows an exponential distribution and the service time is also to be assumed as exponential with a mean of 36 minutes. Calculate: (a) The probability that the yard is empty, (b) The average length assuming that the line capacity of the yard is 9 trains. (Ans: =1/48, =1/36, =0.75, P o =0.5, L=,73 trains). (Rama/9.13) A barbershop has space to accommodate only 10 customers. He can serve only one person at a time. If a customer comes to his shop and finds it is full he goes to the next shop. Customers randomly arrive at an average rate λ = 10 per hour and the barber service time is negative exponential with an average of 5 minute. Find P o and L. (Ans: P o =0.19, L=3.5) 3. (Rama/9.14) A car park can contain 5 cars. The arrival of cars is Poisson at a mean rate of 3 per hour. The length of time each car spends in the car park is exponential distribution with a mean of 0.5 hours. How many cars are in the car park on an average? (Ans: L=4.4 4) 4. (Rama/9.15) Trains arrive at the yard every 15 minutes and the service time is 30 minutes. If the line capacity of the yard is limited to 4 trains, find (a) the probability that the yard is empty and (b) The average number of trains in the system. (Ans: P o =0.016, L= trains) 5. (Rama/9.16) A railway station only one train is handled at a time. The railway yard is sufficient for two trains to wait while other is given signal to leave the station. Trains arrive at a station at an average rate of 6 per hour and the railway station can handle them on an average rate of 1 per hour. Assuming Poisson arrivals and exponential service distribution, a) find the probability of no trains in the system, b) find the average number of trains in the system. (Ans: P o =0.53, L= train) 5.3 The M/M/s Model with Finite Population (M/M/s : N) In some queuing problems, the possible number of arriving customers is finite population. In such a model, the average arrival rate,, for the system changes depending on the number of customers in the queue. Assumptions are: There are s servers, where s is a positive integer. There are N potential customers in the arrival population. The arrival pattern of each customer follows a Poisson distribution with a mean arrival rate of per time period. Each server provides service at an average rate of per time period, and actual service times follow an exponential distribution. Arrivals wait in a single FIFO queue and are serviced by the first available server. WORKED-OUT EXAMPLE 8: The Miller Manufacturing Company owns 10 identical machines that it uses in the production of colored nylon thread for the textile industry. Machine breakdowns occur following a Poisson distribution with an average of 0.01 breakdowns occurring per operating hour per machine. The company loses $100 each hour while a machine is inoperable. The company employs one technician to fix these machines when they break down. Service times to repair the machines are exponentially distributed with an average of eight hours per repair. Thus, service is performed at a rate of 1/8 machines per hour. Management wants to analyze what impact adding another service technician would have on the average length of time required to fix a machine when it breaks down. Service technicians are paid $0 per hour.

11 11 Solution: The 10 machines in this problem represent a finite set. Givens in the question are, Population size=10, Arrival rate=0.01 breakdowns per hour, Service rate= 1/8=0.15, Number of servers = 1 technician. According to cell F11, whenever a machine breaks down, it is out of operation for an average of hours. According to cell F9, averages of approximately 1.54machines are broken in any given hour. Because the company loses $100 each hour a machine is inoperable, the company is presently losing about $15.44 per hour due to machine down time. Thus, with a single service technician, the company is incurring costs at the rate of $17.44 per hour. Cell F10 indicates that when a machine breaks down, repairs start, on average, in only 0.8 hours (or approximately 49 minutes), in comparison to the 10-hour waiting time with only one technician. Similarly, cell F9 indicates that with two technicians, an average of only 0.81 machines are out of operation at any point in time. Thus, by adding another repair technician, Miller Manufacturing can keep approximately one more machine in operation at all times. Thus, while the additional service technician increases the total hourly cost to $40, the decrease in the average number of machines in the system decreases the cost of inoperable machines cost to $81.1. With two service technician, the company is incurring costs at the rate of $11.1 per hour. The net effect is a cost savings of $51.3. Follow up Exercises (M/M/s : N) 1. In the canteen of the IBU, there are three workers each can serve one person in 3 minutes. The population of IBU students is 300 and each student goes to canteen in every day twice. Calculate the number of students in the canteen and total waiting time in the system. (Ans: P o =., L= ). (Render/14.9) One mechanic services 5 drilling machines for a steel plate manufacturer. Machines break down on an average of once every 6 working days, and breakdowns tend to follow a Poisson distribution. The mechanic can handle an average of one repair job per day. Repairs follow an exponential distribution. a. How many machines are waiting for service, on average? b. How many are in the system, on average? c. How many drills are in running order, on average? d. What is the average waiting time in the queue? e. What is the average wait in the system? 3. (Render/14.30) A technician monitors a group of five computers that run an automated manufacturing facility. It takes an average of 15 minutes (exponentially distributed) to adjust a computer that develops a problem. The computer run for an average of 85 minutes (Poisson distributed) without requiring adjustments. What is the a. average number of computers waiting for adjustment? b. average number of computers not in working order? c. probability the system is empty? d. average time in the queue? e. average time in the system?

12 1 5.4 M/G/1 Model (Poisson Arrivals, General time and Single-Channel Model) Constant service times are used when customers or units are processed according to a fixed cycle. The values for L q, W q, L, and W are always less than they would be for models with variable service time. In fact both average queue length and average waiting time are halved in constant service rate models. 1. Average length of the queue L q ( ). Average waiting time in the queue W q ( ) 3. Average number of customers in the system L L q 4. Average time in the system W W q 1 WORKED-OUT EXAMPLE 9: A company collects and compacts aluminum cans and glass bottles. Trucks arrive at an average rate of 8 per hour (Poisson distribution).truck drivers wait about 15 min before they empty their load. Drivers and trucks cost $60 per hour. New automated machine can process truckloads at a constant rate of 1 per hour. New compactor will be amortized at $3 per truck. Solution: Current waiting cost/trip = ( 1 / 4 hour waiting time)($60/hour cost)= $15/trip New system: = 8 trucks/hour arriving, = 1 trucks/hour served Average waiting time in queue = W q = 1 / 1 hour Waiting cost/trip with new compactor = ( 1 / 1 hour wait)($60/hour cost) = $5/trip Savings with new equipment = $15 (current system) $5 (new system) = $10 per trip Cost of new equipment amortized = $3/trip Net savings = $7/trip Follow up Exercises (M/G/1) 1. (Ragsdale/13.5) The day after a snowstorm, cars arrive at Mel s Auto-Wash at an average rate of 10 per hour according to a Poisson process. The automated car washing process takes exactly 5 minutes from start to finish. a. What is the probability that an arriving car will find the car wash empty? b. On average, how many cars are waiting for service? c. On average, what is the total length of time (from arrival to departure) that cars will spend at the car wash?. (Ragsdale/13.)The drive-thru window at Hokie Burger requires.5 minutes on average to process an order with a standard deviation of 3 minutes. Cars arrive at the window at a rate of 0 per hour. a. On average, how many cars are waiting to be served? b. On average, how long will a car spend in the service process? c. Suppose Hokie Burger can install an automated drink-dispensing device that would reduce the standard deviation of the service time to 1 minute. How would your answers to the previous questions change? 3. (Render/14.7) Customers arrive at an automated coffee vending machine at a rate of 4 per minute, following a Poisson distribution. The coffee machine dispenses a cup of coffee in exactly 10 seconds. a. What is the average number of people waiting in line? b. What is the average number in the system? c. How long does the average person wait in line before receiving service?

Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi

Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1) A goal of many waiting line problems is to help

More information

UNIT 6 WAITING LINES/ QUEUING THEORY. Characteristics of waiting line systems Measuring the Queue s performance Suggestions for Managing Queues

UNIT 6 WAITING LINES/ QUEUING THEORY. Characteristics of waiting line systems Measuring the Queue s performance Suggestions for Managing Queues OUTLINE SESSION 6.1: SESSION 6.2: SESSION 6.3: SESSION 6.4: SESSION 6.5: UNIT 6 WAITING LINES/ QUEUING THEORY Introduction Poisson Distribution Characteristics of waiting line systems Measuring the Queue

More information

UNIT 2 QUEUING THEORY

UNIT 2 QUEUING THEORY UNIT 2 QUEUING THEORY LESSON 24 Learning Objective: Apply formulae to find solution that will predict the behaviour of the single server model II. Apply formulae to find solution that will predict the

More information

LECTURE - 1 INTRODUCTION TO QUEUING SYSTEM

LECTURE - 1 INTRODUCTION TO QUEUING SYSTEM LECTURE - 1 INTRODUCTION TO QUEUING SYSTEM Learning objective To introduce features of queuing system 9.1 Queue or Waiting lines Customers waiting to get service from server are represented by queue and

More information

Waiting-Line Models. Quantitative Module. Module Outline LEARNING OBJECTIVES. When you complete this module you should be able to

Waiting-Line Models. Quantitative Module. Module Outline LEARNING OBJECTIVES. When you complete this module you should be able to Quantitative Module D Waiting-Line Models Module Outline CHARACTERISTICS OF A WAITING-LINE SYSTEM Arrival Characteristics Waiting-Line Characteristics Service Characteristics Measuring the Queue s erformance

More information

CHAPTER 7 SECTION 5: RANDOM VARIABLES AND DISCRETE PROBABILITY DISTRIBUTIONS

CHAPTER 7 SECTION 5: RANDOM VARIABLES AND DISCRETE PROBABILITY DISTRIBUTIONS CHAPTER 7 SECTION 5: RANDOM VARIABLES AND DISCRETE PROBABILITY DISTRIBUTIONS TRUE/FALSE 235. The Poisson probability distribution is a continuous probability distribution. F 236. In a Poisson distribution,

More information

Queuing Theory. Long Term Averages. Assumptions. Interesting Values. Queuing Model

Queuing Theory. Long Term Averages. Assumptions. Interesting Values. Queuing Model Queuing Theory Queuing Theory Queuing theory is the mathematics of waiting lines. It is extremely useful in predicting and evaluating system performance. Queuing theory has been used for operations research.

More information

Queuing Theory II 2006 Samuel L. Baker

Queuing Theory II 2006 Samuel L. Baker QUEUING THEORY II 1 More complex queues: Multiple Server Single Stage Queue Queuing Theory II 2006 Samuel L. Baker Assignment 8 is on page 7. Assignment 8A is on page 10. -- meaning that we have one line

More information

Basic Queuing Relationships

Basic Queuing Relationships Queueing Theory Basic Queuing Relationships Resident items Waiting items Residence time Single server Utilisation System Utilisation Little s formulae are the most important equation in queuing theory

More information

QUEUING THEORY. 1. Introduction

QUEUING THEORY. 1. Introduction QUEUING THEORY RYAN BERRY Abstract. This paper defines the building blocks of and derives basic queuing systems. It begins with a review of some probability theory and then defines processes used to analyze

More information

technical note technical note six WAITING LINE MANAGEMENT T ECHNICAL N OTE S IX Queues defined

technical note technical note six WAITING LINE MANAGEMENT T ECHNICAL N OTE S IX Queues defined cha06369_tn06.qxd 9/3/03 2:11 PM Page 242 T ECHNICAL N OTE S IX technical note six WAITING LINE MANAGEMENT 243 Economics of the Waiting Line Problem Cost-effectiveness balance The practical view of waiting

More information

Minimize Wait Time and Improve the Waiting Experience

Minimize Wait Time and Improve the Waiting Experience Improving the Customer Experience Minimize Wait Time and Improve the Waiting Experience www.lavi.com (888) 285-8605 Overview Waiting lines easily become the source of tension between customers and businesses

More information

Simple Queuing Theory Tools You Can Use in Healthcare

Simple Queuing Theory Tools You Can Use in Healthcare Simple Queuing Theory Tools You Can Use in Healthcare Jeff Johnson Management Engineering Project Director North Colorado Medical Center Abstract Much has been written about queuing theory and its powerful

More information

CHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.

CHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is. Some Continuous Probability Distributions CHAPTER 6: Continuous Uniform Distribution: 6. Definition: The density function of the continuous random variable X on the interval [A, B] is B A A x B f(x; A,

More information

Queuing Analysis. Chapter Outline. Learning Objectives SUPPLEMENTARY CHAPTER B

Queuing Analysis. Chapter Outline. Learning Objectives SUPPLEMENTARY CHAPTER B Chapter Outline Analyzing Queues Using Analytical Models Arrival Distribution Service-Time Distribution Queue Discipline Queuing Behavior Single-Server Queuing Model Multiple-Server Queuing Model The Economics

More information

Section 6.1 Discrete Random variables Probability Distribution

Section 6.1 Discrete Random variables Probability Distribution Section 6.1 Discrete Random variables Probability Distribution Definitions a) Random variable is a variable whose values are determined by chance. b) Discrete Probability distribution consists of the values

More information

Before studying this supplement you should know or, if necessary, review

Before studying this supplement you should know or, if necessary, review Waiting Line Models SUPPLEMENT C Before studying this supplement you should know or, if necessary, review 1. Competitive advantages, Chapter 2. 2. Priority rules, Chapter 16. LEARNING OBJECTIVES After

More information

Practice file answer key

Practice file answer key Practice file answer key Unit 1 2 f 3 e 4 b 5 c 6 a 2 head 3 operate 4 subsidiaries 5 employees 6 sell 7 goods 8 make 9 competitors 2 companies 3 subsidiaries 4 goods 5 based 6 specialize 7 provide 8 operates

More information

Waiting Times Chapter 7

Waiting Times Chapter 7 Waiting Times Chapter 7 1 Learning Objectives Interarrival and Service Times and their variability Obtaining the average time spent in the queue Pooling of server capacities Priority rules Where are the

More information

A MODEL OF OPERATIONS CAPACITY PLANNING AND MANAGEMENT FOR ADMINISTRATIVE SERVICE CENTERS

A MODEL OF OPERATIONS CAPACITY PLANNING AND MANAGEMENT FOR ADMINISTRATIVE SERVICE CENTERS A MODEL OF OPERATIONS CAPACITY PLANNING AND MANAGEMENT FOR ADMINISTRATIVE SERVICE CENTERS МОДЕЛ ЗА ПЛАНИРАНЕ И УПРАВЛЕНИЕ НА КАПАЦИТЕТА НА ОПЕРАЦИИТЕ В ЦЕНТЪР ЗА АДМИНИСТРАТИВНО ОБСЛУЖВАНЕ Yulia Yorgova,

More information

Process simulation. Enn Õunapuu enn.ounapuu@ttu.ee

Process simulation. Enn Õunapuu enn.ounapuu@ttu.ee Process simulation Enn Õunapuu enn.ounapuu@ttu.ee Content Problem How? Example Simulation Definition Modeling and simulation functionality allows for preexecution what-if modeling and simulation. Postexecution

More information

Normal and Binomial. Distributions

Normal and Binomial. Distributions Normal and Binomial Distributions Library, Teaching and Learning 14 By now, you know about averages means in particular and are familiar with words like data, standard deviation, variance, probability,

More information

Queuing theory is a mathematical approach to the analysis of waiting lines.

Queuing theory is a mathematical approach to the analysis of waiting lines. Y CHAPTER FOURTEEN QUEUING MODELS AND CAPACITY PLANNING Queuing theory is a mathematical approach to the analysis of waiting lines. Waiting lines in health care organizations can be found wherever either

More information

Modelling the performance of computer mirroring with difference queues

Modelling the performance of computer mirroring with difference queues Modelling the performance of computer mirroring with difference queues Przemyslaw Pochec Faculty of Computer Science University of New Brunswick, Fredericton, Canada E3A 5A3 email pochec@unb.ca ABSTRACT

More information

Effective Utilization of Mobile Call Center Using Queuing Models

Effective Utilization of Mobile Call Center Using Queuing Models Effective Utilization of Mobile Call Center Using Queuing Models Osahenvemwen O. A. and Odiase O. F. Abstract This study presents effective utilization of mobile call center using queuing models. Aim at

More information

PART A: For each worker, determine that worker's marginal product of labor.

PART A: For each worker, determine that worker's marginal product of labor. ECON 3310 Homework #4 - Solutions 1: Suppose the following indicates how many units of output y you can produce per hour with different levels of labor input (given your current factory capacity): PART

More information

Chapter 6. Inventory Control Models

Chapter 6. Inventory Control Models Chapter 6 Inventory Control Models Learning Objectives After completing this chapter, students will be able to: 1. Understand the importance of inventory control and ABC analysis. 2. Use the economic order

More information

Tenth Problem Assignment

Tenth Problem Assignment EECS 40 Due on April 6, 007 PROBLEM (8 points) Dave is taking a multiple-choice exam. You may assume that the number of questions is infinite. Simultaneously, but independently, his conscious and subconscious

More information

1. Repetition probability theory and transforms

1. Repetition probability theory and transforms 1. Repetition probability theory and transforms 1.1. A prisoner is kept in a cell with three doors. Through one of them he can get out of the prison. The other one leads to a tunnel: through this he is

More information

Deployment of express checkout lines at supermarkets

Deployment of express checkout lines at supermarkets Deployment of express checkout lines at supermarkets Maarten Schimmel Research paper Business Analytics April, 213 Supervisor: René Bekker Faculty of Sciences VU University Amsterdam De Boelelaan 181 181

More information

IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS

IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)

More information

The problem with waiting time

The problem with waiting time The problem with waiting time Why the only way to real optimization of any process requires discrete event simulation Bill Nordgren, MS CIM, FlexSim Software Products Over the years there have been many

More information

Chapter 4. Probability Distributions

Chapter 4. Probability Distributions Chapter 4 Probability Distributions Lesson 4-1/4-2 Random Variable Probability Distributions This chapter will deal the construction of probability distribution. By combining the methods of descriptive

More information

ISyE 2030 Test 2 Solutions

ISyE 2030 Test 2 Solutions 1 NAME ISyE 2030 Test 2 Solutions Fall 2004 This test is open notes, open books. Do precisely 5 of the following problems your choice. You have exactly 55 minutes. 1. Suppose that we are simulating the

More information

Probability Models.S1 Introduction to Probability

Probability Models.S1 Introduction to Probability Probability Models.S1 Introduction to Probability Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard The stochastic chapters of this book involve random variability. Decisions are

More information

Static & Mobile Security Services Tender

Static & Mobile Security Services Tender Static & Mobile Security Services Tender Updated 17th December 2014 Interviews Companies shortlisted for the security tender will be invited to the Council s Mill Road depot in Cambridge on Monday the

More information

Interpreting the Numbers: From Data to Design. William Elenbark, Consultant Gross & Associates 732-636-2666; belenbark@grossassociates.

Interpreting the Numbers: From Data to Design. William Elenbark, Consultant Gross & Associates 732-636-2666; belenbark@grossassociates. Interpreting the Numbers: From Data to Design William Elenbark, Consultant Gross & Associates 732-636-2666; belenbark@grossassociates.com Robert Muller, Industrial Engineer Gross & Associates 732-636-2666;

More information

CHAPTER 05 STRATEGIC CAPACITY PLANNING FOR PRODUCTS AND SERVICES

CHAPTER 05 STRATEGIC CAPACITY PLANNING FOR PRODUCTS AND SERVICES CHAPTER 05 STRATEGIC CAPACITY PLANNING FOR PRODUCTS AND SERVICES Solutions Actual output 7 1. a. Utilizatio n x100% 70.00% Design capacity 10 Actual output 7 Efficiency x100% 87.50% Effective capacity

More information

1: B asic S imu lati on Modeling

1: B asic S imu lati on Modeling Network Simulation Chapter 1: Basic Simulation Modeling Prof. Dr. Jürgen Jasperneite 1 Contents The Nature of Simulation Systems, Models and Simulation Discrete Event Simulation Simulation of a Single-Server

More information

Performance Analysis of a Telephone System with both Patient and Impatient Customers

Performance Analysis of a Telephone System with both Patient and Impatient Customers Performance Analysis of a Telephone System with both Patient and Impatient Customers Yiqiang Quennel Zhao Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba Canada R3B 2E9

More information

Chapter 5 Discrete Probability Distribution. Learning objectives

Chapter 5 Discrete Probability Distribution. Learning objectives Chapter 5 Discrete Probability Distribution Slide 1 Learning objectives 1. Understand random variables and probability distributions. 1.1. Distinguish discrete and continuous random variables. 2. Able

More information

QUEUING. Chapter CHAPTER OUTLINE

QUEUING. Chapter CHAPTER OUTLINE 15 Chapter QUEUING CHAPTER OUTLINE 15.1 Introduction 15.2 The Basic Model 15.3 A Taxonomy of Queuing Models 15.4 Little s Flow Equation and Related Results 15.5 The M/G/1 Queue 15.6 Model 1: An M/M/s Queue

More information

Chapter 2. Simulation Examples 2.1. Prof. Dr. Mesut Güneş Ch. 2 Simulation Examples

Chapter 2. Simulation Examples 2.1. Prof. Dr. Mesut Güneş Ch. 2 Simulation Examples Chapter 2 Simulation Examples 2.1 Contents Simulation using Tables Simulation of Queueing Systems Examples A Grocery Call Center Inventory System Appendix: Random Digits 1.2 Simulation using Tables 1.3

More information

Notes on Continuous Random Variables

Notes on Continuous Random Variables Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes

More information

Some special discrete probability distributions

Some special discrete probability distributions University of California, Los Angeles Department of Statistics Statistics 100A Instructor: Nicolas Christou Some special discrete probability distributions Bernoulli random variable: It is a variable that

More information

Basic Multiplexing models. Computer Networks - Vassilis Tsaoussidis

Basic Multiplexing models. Computer Networks - Vassilis Tsaoussidis Basic Multiplexing models? Supermarket?? Computer Networks - Vassilis Tsaoussidis Schedule Where does statistical multiplexing differ from TDM and FDM Why are buffers necessary - what is their tradeoff,

More information

How To Manage A Call Center

How To Manage A Call Center THE ROLE OF SIMULATION IN CALL CENTER MANAGEMENT Roger Klungle AAA Michigan Introduction With recent advances in technology and the changing nature of business, call center management has become a rapidly

More information

Gateway2Travel Manual

Gateway2Travel Manual Gateway2Travel Manual Hotels Transfers www.gateway.be 1 Content GENERAL 3 1. USE 4 1.1 ACCESS... 4 1.2 START SCREEN... 4 1.3 INDIVIDUAL SETTINGS (PER PC)... 4 2. HOTELS 5 2.1 SELECTION SCREEN... 5 2.2

More information

BINOMIAL DISTRIBUTION

BINOMIAL DISTRIBUTION MODULE IV BINOMIAL DISTRIBUTION A random variable X is said to follow binomial distribution with parameters n & p if P ( X ) = nc x p x q n x where x = 0, 1,2,3..n, p is the probability of success & q

More information

Business Statistics, 9e (Groebner/Shannon/Fry) Chapter 9 Introduction to Hypothesis Testing

Business Statistics, 9e (Groebner/Shannon/Fry) Chapter 9 Introduction to Hypothesis Testing Business Statistics, 9e (Groebner/Shannon/Fry) Chapter 9 Introduction to Hypothesis Testing 1) Hypothesis testing and confidence interval estimation are essentially two totally different statistical procedures

More information

WHAT YOU SHOULD KNOW ABOUT MERGING YOUR PRACTICE

WHAT YOU SHOULD KNOW ABOUT MERGING YOUR PRACTICE WHAT YOU SHOULD KNOW ABOUT MERGING YOUR PRACTICE One night at dinner with his friend and colleague John, Bruce looks at him and says, we are both successful, good friends, cover for each other and trust

More information

Smart Shopping Cart. Group 5. March 11, 2008. Advisor: Professor Haibo He

Smart Shopping Cart. Group 5. March 11, 2008. Advisor: Professor Haibo He Smart Shopping Cart Group 5 March 11, 2008 Advisor: Professor Haibo He ------------------------------ Group Members: Norasyikin Fadilah Siti Fatimah Ahmad Anirudh Argawal Rajwinder Singh Katherine Casella

More information

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. 1) If two events are mutually exclusive, what is the probability that one or the other occurs? A)

More information

PRIORITY DISPATCH SCHEDULING IN AN AUTOMOBILE REPAIR AND MAINTENANCE WORKSHOP

PRIORITY DISPATCH SCHEDULING IN AN AUTOMOBILE REPAIR AND MAINTENANCE WORKSHOP Journal of Engineering Science and Technology Vol. 6, No. 5 (2011) 606-618 School of Engineering, Taylor s University PRIORITY DISPATCH SCHEDULING IN AN AUTOMOBILE REPAIR AND MAINTENANCE WORKSHOP AKINYEMI

More information

Binomial Distribution Problems. Binomial Distribution SOLUTIONS. Poisson Distribution Problems

Binomial Distribution Problems. Binomial Distribution SOLUTIONS. Poisson Distribution Problems 1 Binomial Distribution Problems (1) A company owns 400 laptops. Each laptop has an 8% probability of not working. You randomly select 20 laptops for your salespeople. (a) What is the likelihood that 5

More information

Last Reviewed: November 25, 2014 WOOD COUNTY BOARD OF EDUCATION. Policy 5160.3 Transportation Employees Alcohol and Controlled Substance Policy

Last Reviewed: November 25, 2014 WOOD COUNTY BOARD OF EDUCATION. Policy 5160.3 Transportation Employees Alcohol and Controlled Substance Policy WOOD COUNTY BOARD OF EDUCATION Policy 5160.3 Transportation Employees Alcohol and Controlled Substance Policy Last Reviewed: November 25, 2014 Next Review: November 25, 2016 Section 1.0 Introduction The

More information

LONDON CYCLE HIRE SERVICE AGREEMENT. Schedule 5 Service Level Agreement. Schedule 5 Service Level Agreement

LONDON CYCLE HIRE SERVICE AGREEMENT. Schedule 5 Service Level Agreement. Schedule 5 Service Level Agreement LONDON CYCLE HIRE SERVICE AGREEMENT Schedule 5 Service Level Agreement Transport for London Version Final Page 1 of 32 Schedule 5 Service Level Agreement 1. Performance Management Regime Objectives The

More information

4 UNIT FOUR: Transportation and Assignment problems

4 UNIT FOUR: Transportation and Assignment problems 4 UNIT FOUR: Transportation and Assignment problems 4.1 Objectives By the end of this unit you will be able to: formulate special linear programming problems using the transportation model. define a balanced

More information

6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory

6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory 6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory Massachusetts Institute of Technology Slide 1 Packet Switched Networks Messages broken into Packets that are routed To their destination PS PS

More information

1.1 Introduction. Chapter 1: Feasibility Studies: An Overview

1.1 Introduction. Chapter 1: Feasibility Studies: An Overview Chapter 1: Introduction 1.1 Introduction Every long term decision the firm makes is a capital budgeting decision whenever it changes the company s cash flows. Consider launching a new product. This involves

More information

Extensive operating room (OR) utilization is a goal

Extensive operating room (OR) utilization is a goal Determining Optimum Operating Room Utilization Donald C. Tyler, MD, MBA*, Caroline A. Pasquariello, MD*, and Chun-Hung Chen, PhD *Department of Anesthesiology and Critical Care Medicine, The Children s

More information

12.5: CHI-SQUARE GOODNESS OF FIT TESTS

12.5: CHI-SQUARE GOODNESS OF FIT TESTS 125: Chi-Square Goodness of Fit Tests CD12-1 125: CHI-SQUARE GOODNESS OF FIT TESTS In this section, the χ 2 distribution is used for testing the goodness of fit of a set of data to a specific probability

More information

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture - 41 Value of Information In this lecture, we look at the Value

More information

Tracking Truck Flows for Drayage Efficiency Analysis

Tracking Truck Flows for Drayage Efficiency Analysis Tracking Truck Flows for Drayage Efficiency Analysis Shui Lam Byung Lee Jay Patel California State Univ. Long Beach METRANS SEMINAR Nov. 14, 2015 (Project funded by CALTRANS) Presentation Outline 1. Problem

More information

3 Weeks Before You Depart www.commbank.com.au/movingtoaustralia Banking in Australia 1 Week Before www.smarttraveller.gov.au

3 Weeks Before You Depart www.commbank.com.au/movingtoaustralia Banking in Australia 1 Week Before www.smarttraveller.gov.au Banking in Australia Banking in Australia Moving countries and banks is always a big step. There s plenty to think about, and lots to do. Luckily for you, the Australian banking system is one of the safest

More information

CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION

CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION 31 CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION 3.1 INTRODUCTION In this chapter, construction of queuing model with non-exponential service time distribution, performance

More information

On Admission Control Policy for Multi-tasking Live-chat Service Agents Research-in-progress Paper

On Admission Control Policy for Multi-tasking Live-chat Service Agents Research-in-progress Paper On Admission Control Policy for Multi-tasking Live-chat Service Agents Research-in-progress Paper Paulo Goes Dept. of Management Information Systems Eller College of Management, The University of Arizona,

More information

Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.

Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4. Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than

More information

Cumulative Diagrams: An Example

Cumulative Diagrams: An Example Cumulative Diagrams: An Example Consider Figure 1 in which the functions (t) and (t) denote, respectively, the demand rate and the service rate (or capacity ) over time at the runway system of an airport

More information

ANALYSIS OF THE QUALITY OF SERVICES FOR CHECKOUT OPERATION IN ICA SUPERMARKET USING QUEUING THEORY. Azmat Nafees Liwen Liang. M. Sc.

ANALYSIS OF THE QUALITY OF SERVICES FOR CHECKOUT OPERATION IN ICA SUPERMARKET USING QUEUING THEORY. Azmat Nafees Liwen Liang. M. Sc. ANALYSIS OF THE QUALITY OF SERVICES FOR CHECKOUT OPERATION IN ICA SUPERMARKET USING QUEUING THEORY by Azmat Nafees Liwen Liang A C level essay in Statistics submitted in partial fulfillment of the requirements

More information

Part 1 : 07/28/10 08:41:15

Part 1 : 07/28/10 08:41:15 Question 1 - CIA 1192 IV-21 - Manufacturing Input Variances - Materials and Labor A manufacturer has the following direct materials standard for one of its products. Direct materials: 3 pounds @ $1.60/pound

More information

Personal Financial Literacy

Personal Financial Literacy Personal Financial Literacy 7 Unit Overview Being financially literate means taking responsibility for learning how to manage your money. In this unit, you will learn about banking services that can help

More information

AE64 TELECOMMUNICATION SWITCHING SYSTEMS

AE64 TELECOMMUNICATION SWITCHING SYSTEMS Q2. a. Draw the schematic of a 1000 line strowger switching system and explain how subscribers get connected. Ans: (Page: 61 of Text book 1 and 56 of Text book 2) b. Explain the various design parameters

More information

Allworx Queuing and Automated Call Distribution Guide (Release 7.2.3.x)

Allworx Queuing and Automated Call Distribution Guide (Release 7.2.3.x) Allworx Queuing and Automated Call Distribution Guide (Release 7.2.3.x) No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic,

More information

PFA TRAVEL rental agreement

PFA TRAVEL rental agreement 1/6 PFA TRAVEL rental agreement Between PFA Travel, French société à responsabilité limitée with a share capital of 7700, registered with the Paris company registry under number 538 301 540 and registered

More information

For companies exhibiting at the Digital Dealer Conference & Exhibition.

For companies exhibiting at the Digital Dealer Conference & Exhibition. For companies exhibiting at the Digital Dealer Conference & Exhibition. Whether you are a company that has been exhibiting for years or this is your first time, the information contained in this Exhibitor

More information

1 Math 1313 Final Review Final Review for Finite. 1. Find the equation of the line containing the points 1, 2)

1 Math 1313 Final Review Final Review for Finite. 1. Find the equation of the line containing the points 1, 2) Math 33 Final Review Final Review for Finite. Find the equation of the line containing the points, 2) ( and (,3) 2. 2. The Ace Company installed a new machine in one of its factories at a cost of $2,.

More information

What is a Credit Score and Why Do I Care What It Is?

What is a Credit Score and Why Do I Care What It Is? What is a Credit Score and Why Do I Care What It Is? Your Credit Score is a lot like the score you get on a test. You get points for good credit decisions and behavior and you get points taken away for

More information

M/M/1 and M/M/m Queueing Systems

M/M/1 and M/M/m Queueing Systems M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential

More information

Military Reliability Modeling William P. Fox, Steven B. Horton

Military Reliability Modeling William P. Fox, Steven B. Horton Military Reliability Modeling William P. Fox, Steven B. Horton Introduction You are an infantry rifle platoon leader. Your platoon is occupying a battle position and has been ordered to establish an observation

More information

CALL CENTER PERFORMANCE EVALUATION USING QUEUEING NETWORK AND SIMULATION

CALL CENTER PERFORMANCE EVALUATION USING QUEUEING NETWORK AND SIMULATION CALL CENTER PERFORMANCE EVALUATION USING QUEUEING NETWORK AND SIMULATION MA 597 Assignment K.Anjaneyulu, Roll no: 06212303 1. Introduction A call center may be defined as a service unit where a group of

More information

Finally, a phone system designed around the way you do business! Priced so that you can stay in Business! Pizza Phone System 719 Brookside Dr, Lansing, MI 48917 Phone (866) 317-7396 www.pizzaphonesystem

More information

BFI New Driver Quick List

BFI New Driver Quick List BFI New Driver Quick List Truck Number Trailer Number Driver ID Card Pin: The Business Owner operator-has his own operating authority from the FMCSA and may or may not drive. Must comply with all FMCSA

More information

Allworx Queuing and Automated Call Distribution Guide (Release 7.1.0.x)

Allworx Queuing and Automated Call Distribution Guide (Release 7.1.0.x) Allworx Queuing and Automated Call Distribution Guide (Release 7.1.0.x) No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic,

More information

GLOBAL REASONING TEST PRACTICE TEST

GLOBAL REASONING TEST PRACTICE TEST GLOBAL REASONING TEST PRACTICE TEST COPYRIGHT 2008 PROCTER & GAMBLE CINCINNATI, OH 45202 U.S.A. WARNING: All rights reserved. No part of this booklet may be reproduced in any form or by any means without

More information

Random variables, probability distributions, binomial random variable

Random variables, probability distributions, binomial random variable Week 4 lecture notes. WEEK 4 page 1 Random variables, probability distributions, binomial random variable Eample 1 : Consider the eperiment of flipping a fair coin three times. The number of tails that

More information

What You ll Learn. And Why. Key Words. interest simple interest principal amount compound interest compounding period present value future value

What You ll Learn. And Why. Key Words. interest simple interest principal amount compound interest compounding period present value future value What You ll Learn To solve problems involving compound interest and to research and compare various savings and investment options And Why Knowing how to save and invest the money you earn will help you

More information

AS-D2 THE ROLE OF SIMULATION IN CALL CENTER MANAGEMENT. Dr. Roger Klungle Manager, Business Operations Analysis

AS-D2 THE ROLE OF SIMULATION IN CALL CENTER MANAGEMENT. Dr. Roger Klungle Manager, Business Operations Analysis AS-D2 THE ROLE OF SIMULATION IN CALL CENTER MANAGEMENT Dr. Roger Klungle Manager, Business Operations Analysis AAA Michigan 1 Auto Club Drive Dearborn, MI 48126 U.S.A. Phone: (313) 336-9946 Fax: (313)

More information

14.1 Rent-or-buy problem

14.1 Rent-or-buy problem CS787: Advanced Algorithms Lecture 14: Online algorithms We now shift focus to a different kind of algorithmic problem where we need to perform some optimization without knowing the input in advance. Algorithms

More information

6.4 Normal Distribution

6.4 Normal Distribution Contents 6.4 Normal Distribution....................... 381 6.4.1 Characteristics of the Normal Distribution....... 381 6.4.2 The Standardized Normal Distribution......... 385 6.4.3 Meaning of Areas under

More information

Contents. Specialty Answering Service. All rights reserved.

Contents. Specialty Answering Service. All rights reserved. [Type text] Contents 1 Introduction... 3 2 Service Metrics... 5 2.1 Accessibility Metrics... 5 2.1.1 Blockage... 5 2.1.2 Hours of Operation... 5 2.1.3 Abandoned Calls... 5 2.2 Speed of Service... 6 2.2.1

More information

32-35131 PADOVA (PD) - R.E.A.

32-35131 PADOVA (PD) - R.E.A. - 1 - THE LOGISTIC SOLUTION FOR WAREHOUSE - 2 - SUMMARY INTRODUCTION 4 1.1. INTEGRATION WITH THE BUSINESS INFORMATION SYSTEM 4 1. KEY FEATURES 5 1.2. ASSETS UNDER MANAGEMENT 5 1.3. INDEPENDENCE FROM THE

More information

6 Costing of Service Sector

6 Costing of Service Sector 6 Costing of Service Sector LEARNING OBJECTIVES : After finishing this chapter, you will be able to understand and appreciate the peculiarities involved in the costing of service sector. Through this chapter

More information

Warehouse Layout and Design

Warehouse Layout and Design A warehouse is a warehouse. It s a big box in which you store inventory. Well, today s warehouse isn t the warehouse that it was twenty years ago and it s going to be totally different in the future. The

More information

COST THEORY. I What costs matter? A Opportunity Costs

COST THEORY. I What costs matter? A Opportunity Costs COST THEORY Cost theory is related to production theory, they are often used together. However, the question is how much to produce, as opposed to which inputs to use. That is, assume that we use production

More information

Call Center Metrics: Glossary of Terms

Call Center Metrics: Glossary of Terms Call Center Metrics: Glossary of Terms A. abandoned call. A call or other type of contact that has been offered into a communications network or telephone system but is terminated by the person originating

More information

Network Design Performance Evaluation, and Simulation #6

Network Design Performance Evaluation, and Simulation #6 Network Design Performance Evaluation, and Simulation #6 1 Network Design Problem Goal Given QoS metric, e.g., Average delay Loss probability Characterization of the traffic, e.g., Average interarrival

More information

Chapter 16 Inventory Management and Control

Chapter 16 Inventory Management and Control Chapter 16 Inventory Management and Control We shall be interested primarily in the control of material in manufacturing. Actually, we are concerned with the control of the flow of material from a raw

More information

Ch5: Discrete Probability Distributions Section 5-1: Probability Distribution

Ch5: Discrete Probability Distributions Section 5-1: Probability Distribution Recall: Ch5: Discrete Probability Distributions Section 5-1: Probability Distribution A variable is a characteristic or attribute that can assume different values. o Various letters of the alphabet (e.g.

More information

Module 2 Probability and Statistics

Module 2 Probability and Statistics Module 2 Probability and Statistics BASIC CONCEPTS Multiple Choice Identify the choice that best completes the statement or answers the question. 1. The standard deviation of a standard normal distribution

More information