Waiting Lines and Queuing Theory Models


 Thomasine King
 2 years ago
 Views:
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 tradeoff 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. WORKEDOUT 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 WORKEDOUT 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 firstin, firstout (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 singlechannel system with one server is quite common. Multichannel systems exist when multiple servers are fed by one common waiting line. In a singlephase 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 SingleChannel 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 WORKEDOUT 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 WORKEDOUT 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 4hour 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 WORKEDOUT 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 twominute average waiting time objective Rod wants. WORKEDOUT 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 emergencyroom 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 emergencyroom 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 longdistance 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 taxconsulting 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: WORKEDOUT 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 twominute 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. WORKEDOUT 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 10hour 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 SingleChannel 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 WORKEDOUT 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 AutoWash 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 drivethru 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 drinkdispensing 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 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 informationUNIT 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 informationUNIT 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 informationLecture 3 APPLICATION OF SIMULATION IN SERVICE OPERATIONS MANAGEMENT
Lecture 3 APPLICATION OF SIMULATION IN SERVICE OPERATIONS MANAGEMENT Learning Objective To discuss application of simulation in services 1. SIMULATION Simulation is a powerful technique for solving a wide
More informationService Management Capacity Planning and Queuing Models
Service Management Capacity Planning and Queuing Models Univ.Prof. Dr.Ing. Wolfgang Maass Chair in Economics Information and Service Systems (ISS) Saarland University, Saarbrücken, Germany WS 2011/2012
More informationWaitingLine Models. Quantitative Module. Module Outline LEARNING OBJECTIVES. When you complete this module you should be able to
Quantitative Module D WaitingLine Models Module Outline CHARACTERISTICS OF A WAITINGLINE SYSTEM Arrival Characteristics WaitingLine Characteristics Service Characteristics Measuring the Queue s erformance
More informationLECTURE  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 informationMaximum Profits. Desired Service Level.
Queuing Models 1 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
More informationCHAPTER 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 informationQueuing 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 informationOPIM 631 Operations Management: Quality and Productivity. How Variability Impacts Process Performance 1
The Wharton School Quarter II The University of Pennsylvania Fall 1999 OPIM 631 Operations Management: Quality and Productivity How Variability Impacts Process Performance 1 In most processes, the demand
More informationQueuing Model Dr. Yifeng Zhu. In queueing theory, the average number of tasks in a stable system (over some time interval), N, is given by
Note 3: M/M/ April, 007 ECE598 Advanced Computer Architecture URL: http://www.eece.maine.edu/ zhu/ece598/ Queuing Model Dr. Yifeng Zhu Little s law In queueing theory, the average number of tasks in a
More informationQueuing 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 informationSimple 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 informationSimulation in der Logistik ehem.: Simulation in Logistics I. Queueing Models and its application in Dosimis3
UNIVERSITÄT D U I S B U R G E S S E N Campus Duisburg Department of Engineering Sciences Division of Mechanical Engineering Transport Systems and Logistics Lotharstraße 121 47057 Duisburg Phone: 0203
More informationSlides 5: General Principles of DiscreteEvent System Simulation
Slides 5: General Principles of DiscreteEvent System Simulation Purpose Develops a common framework for the modeling of complex systems. Covers the basic blocks for all discreteevent simulation models.
More informationAN AUTOMATIC PRIORITY QUEUEING MODEL FOR BANKING SYSTEM
ISSN 22772685 IJESR/April 2016/ Vol6/Issue4/8288 Tabi Nandan Joshi et. al., / International Journal of Engineering & Science Research AN AUTOMATIC PRIORITY QUEUEING MODEL FOR BANKING SYSTEM ABSTRACT
More informationA Proposal To Finding An Analytical Solution For The Probability Of j Units In An M/G/1 System
A Proposal To Finding An Analytical Solution For The Probability Of j Units In An M/G/1 System By Philip Kalinda * MSc Business Analytics and Decision Sciences University of Leeds, Leeds, UK Introduction
More informationBasic 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 informationtechnical 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 Costeffectiveness balance The practical view of waiting
More informationQueuing Theory I 2006 Samuel L. Baker
QUEUING THEORY I 1 Queuing Theory I 2006 Samuel L. Baker Assignment 7 is on page 8. Assignment 7A is on page 13. Queuing theory is the analysis of waiting lines, or "queues". The goal of this unit of the
More informationQUEUING 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 informationPerformance Analysis of Computer Systems
Performance Analysis of Computer Systems Introduction to Queuing Theory Holger Brunst (holger.brunst@tudresden.de) Matthias S. Mueller (matthias.mueller@tudresden.de) Summary of Previous Lecture Simulation
More informationQueuing Analysis. Chapter Outline. Learning Objectives SUPPLEMENTARY CHAPTER B
Chapter Outline Analyzing Queues Using Analytical Models Arrival Distribution ServiceTime Distribution Queue Discipline Queuing Behavior SingleServer Queuing Model MultipleServer Queuing Model The Economics
More informationCHAPTER 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 informationMinimize Wait Time and Improve the Waiting Experience
Improving the Customer Experience Minimize Wait Time and Improve the Waiting Experience www.lavi.com (888) 2858605 Overview Waiting lines easily become the source of tension between customers and businesses
More informationA 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 informationBefore 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 informationOutline. Simulation examples will be given in queuing, inventory, reliability and network analysis.
Simulation Examples Today I ll present several examples of simulations that can be performed by devising a simulation table either manually or with a spreadsheet. This will provide insight into the methodology
More informationCHAPTER 22 (FIN MAN); CHAPTER 7 (MAN) PERFORMANCE EVALUATION USING VARIANCES FROM STANDARD COSTS
(FIN MAN); CHAPTER 7 (MAN) PERFORMANCE EVALUATION USING VARIANCES FROM STANDARD COSTS 1. Standards are performance goals. Manufacturing companies normally use standard cost for each of the three following
More informationWaiting 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 informationProcess 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 whatif modeling and simulation. Postexecution
More informationSection 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 informationQueuing 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 informationPerformance 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 informationPractice 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 informationSpecialty Answering Service. All rights reserved.
0 Contents 1 Introduction to Queueing Theory... 2 1.1 Kendall s Notation... 2 1.2 Queueing Models... 3 1.2.1 Single Server Queue... 3 1.2.2 Multiple Servers Queue... 3 1.2.3 Infinitely Many Servers...
More informationModelling 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 information5.3. The Poisson distribution. Introduction. Prerequisites. Learning Outcomes. Learning Style
The Poisson distribution 5.3 Introduction In this block we introduce a probability model which can be used when the outcome of an experiment is a random variable taking on positive integer values and where
More informationChapter 5. Arena Basics
SIMULATION MODELING AND ANALYSIS WITH ARENA T. Altiok and B. Melamed Arena Basics 1 The Arena Simulation System Arena is a powerful simulation environment consists of modeling object templates, called
More informationProduct Costing: Manufacturing Processes, Cost Terminology, and Cost Flows
Concept Questions Chapter 2 Product Costing: Manufacturing Processes, Cost Terminology, and Cost Flows 1. (LO1 Inventory accounts raw materials, WIP, and finished goods) Raw materials inventory is the
More informationIEOR 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 informationEXERCISES. Ex (FIN MAN); Ex. 7 1 (MAN) Ex (FIN MAN); Ex. 7 2 (MAN)
Ex. 22 1 (FIN MAN); Ex. 7 1 (MAN) EXERCISES Ingredient Quantity Price Total Cocoa 510 lbs. $0.70 per lb. $357.00 Sugar 150 lbs. $1.18 per lb. 177.00 Milk 120 gal. $1.80 per gal. 216.00 Total cost $750.00
More informationEffective 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 informationChapter 4. Probability Distributions
Chapter 4 Probability Distributions Lesson 41/42 Random Variable Probability Distributions This chapter will deal the construction of probability distribution. By combining the methods of descriptive
More information1. 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 informationChapter 2: Data quantifiers: sample mean, sample variance, sample standard deviation Quartiles, percentiles, median, interquartile range Dot diagrams
Review for Final Chapter 2: Data quantifiers: sample mean, sample variance, sample standard deviation Quartiles, percentiles, median, interquartile range Dot diagrams Histogram Boxplots Chapter 3: Set
More informationProbability 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 informationEconomic and Management Sciences Grade 7 Term 2. FINANCIAL LITERACY Topic 5: Accounting Concepts
1 Economic and Management Sciences Grade 7 Term 2 FINANCIAL LITERACY Topic 5: Accounting Concepts There are certain basic accounting concepts that are used throughout the business world. It is important
More informationNormal, Binomial, Poisson Distributions
Library, Teaching and Learning Normal, Binomial, oisson Distributions QMET1 14 Lincoln University Did you know that QMET stands for Quantitative Methods? That is, methods for dealing with quantitative
More informationNormal 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 informationSingle Workstation Factory Models
Chapter 3 Single Workstation Factory Models Throughout the analyses given in this textbook, emphasis is on the development of steadystate system measures such as the expected number of jobs in the system
More information37.3. The Poisson distribution. Introduction. Prerequisites. Learning Outcomes
The Poisson distribution 37.3 Introduction In this block we introduce a probability model which can be used when the outcome of an experiment is a random variable taking on positive integer values and
More informationDeployment 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 informationTHE ROLE OF SIMULATION IN CALL CENTER MANAGEMENT. Roger Klungle AAA Michigan. Introduction
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 informationSimulation. Advantages of Simulation. The Process of Simulation. To simulate is to try to duplicate the characteristics of a real system
Simulation To simulate is to try to duplicate the characteristics of a real system We will study mathematical simulation models of real systems to help make business decisions Simulation is one of the
More informationBasic Statistics Self Assessment Test
Basic Statistics Self Assessment Test Professor Douglas H. Jones PAGE 1 A sodadispensing machine fills 12ounce cans of soda using a normal distribution with a mean of 12.1 ounces and a standard deviation
More informationSales Price
Stat 213 Review Questions Note: Just because a topic is not on the review, does not mean that it will not be on the final. Review all the tests, labs, assignments and class notes. 1. A psychologist wished
More information1: 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 SingleServer
More informationCALL 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 information4) The goodness of fit test is always a one tail test with the rejection region in the upper tail. Answer: TRUE
Business Statistics, 9e (Groebner/Shannon/Fry) Chapter 13 Goodness of Fit Tests and Contingency Analysis 1) A goodness of fit test can be used to determine whether a set of sample data comes from a specific
More informationChapter 12 Production and Cost
Chapter 12 Production and Cost 12.1 Economic Cost and Profit 1) Which of the following is a firm's fundamental goal? A) producing a quality product B) maximizing workforce job satisfaction C) improving
More informationMULTIPLE 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 informationChapter 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 informationChapter 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 informationBINOMIAL 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 informationRideSharing on PRT. Prof. Ingmar Andréasson. LogistikCentrum, Taljegardsgatan 11, SE Molndal,
RideSharing on PRT Prof. Ingmar Andréasson LogistikCentrum, Taljegardsgatan 11, SE43153 Molndal, email: ingmar@logistikcentrum.se Abstract The name Personal Rapid Transit (PRT) indicates that passengers
More informationLONDON 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 informationQUEUING. 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 informationRental ID #55 Louvre two Bedroom 23 rue Herold, 75001 Paris. Thanks for booking with VIP and welcome to Paris!
USA Toll Free: 1800 403 4304 From Europe: +44(0) 20 3002 0760 Worldwide: +1973 948 3535 Rental ID #55 Louvre two Bedroom 23 rue Herold, 75001 Paris Please print and carry this document so it is easily
More information4 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 informationAE64 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 informationPart 1 : 07/28/10 08:41:15
Question 1  CIA 1192 IV21  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 informationModule 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 informationThe 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 information6.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 informationFinancial Literacy Part Two
Financial Literacy Part Two 1. Banks and Credit Unions Credit Unions Credit unions do not make a profit. They are owned and run by their members. The members have something in common: religious interest,
More informationCPU Scheduling. Prof. Sirer (dr. Willem de Bruijn) CS 4410 Cornell University
CPU Scheduling Prof. Sirer (dr. Willem de Bruijn) CS 4410 Cornell University Problem You are the cook at the state st. diner customers continually enter and place their orders Dishes take varying amounts
More informationAssignment #2 for Computer Networks
Assignment # for Computer Networks Savvas C. Nikiforou Department of Computer Science and Engineering University of South Florida Tampa, FL 6 Abstract The purpose of this assignment is to compare the queueing
More informationChapter 2 JobOrder Costing and Modern Manufacturing Practices
Chapter 2 JobOrder Costing and Modern Manufacturing Practices QUESTIONS 1. Manufacturers need product costing systems in order to measure and record the cost of manufactured products. Product cost information
More informationCHAPTER 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 informationInterpreting the Numbers: From Data to Design. William Elenbark, Consultant Gross & Associates 7326362666; belenbark@grossassociates.
Interpreting the Numbers: From Data to Design William Elenbark, Consultant Gross & Associates 7326362666; belenbark@grossassociates.com Robert Muller, Industrial Engineer Gross & Associates 7326362666;
More informationProjection of Income for:
Projection of Income for: Year 1 2 3 Gross Sales Less: Returns & Allowances Cost of Goods Sold Gross Profit Other Income Expenses Advertising Bad Debts Car & Truck Franchise Expense Royalty Fee Insurance
More informationAllworx 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 informationChapter 9 Monté Carlo Simulation
MGS 3100 Business Analysis Chapter 9 Monté Carlo What Is? A model/process used to duplicate or mimic the real system Types of Models Physical simulation Computer simulation When to Use (Computer) Models?
More informationBasic 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 informationManaging Money. Where does your money go? Eight Steps to Better Money Management. Setting Goals
Option 7 Teacher Information Page 1 Where does your money go? Managing Money If you do not keep track of your expenses, you won t whether you are spending your money wisely. When you know where your money
More informationQueuing Formulas. 1 Notation 2. 2 Basic Queueing Formulas 2
Queuing Formulas Contents 1 Notation 2 2 Basic Queueing Formulas 2 3 SingleServer Queues 3 3.1 Formulas...................................... 3 3.2 Some additional useful facts...........................
More information1.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 informationGrow your business with an integrated rental and financial system from Microsoft Dynamics
Grow your business with an integrated rental and financial system from Microsoft Dynamics Microsoft Dynamics NAV gives the rental industry an integrated, realtime rental management solution with flexible
More informationLectures 5 & / Introduction to Queueing Theory
Lectures 5 & 6 6.263/16.37 Introduction to Queueing Theory MIT, LIDS Slide 1 Packet Switched Networks Messages broken into Packets that are routed To their destination PS PS PS PS Packet Network PS PS
More informationSome 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 informationPerformance of Switching Networks
Performance of Switching Networks (A general view based on a simple model) JP Dufey, CERN Outline: Overview and Definitions Non Blocking vs Blocking Switches Input vs Output Queueing Simulation Model
More informationThe Beginner s Guide to Inventory Management
The Beginner s Guide to Inventory Management Brought to you by Cin7 What is inventory? Inventory is a broad term that encompasses every physical thing that a business owns  from the desks and computers
More informationStatic & 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 informationPerformance Analysis, Autumn 2010
Performance Analysis, Autumn 2010 Bengt Jonsson November 16, 2010 Kendall Notation Queueing process described by A/B/X /Y /Z, where Example A is the arrival distribution B is the service pattern X the
More informationAllworx 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 informationREVIEW PROBLEM 1: VARIANCE ANALYSIS USING A FLEXIBLE BUDGET
REVIEW PROBLEM 1: VARIANCE ANALYSIS USING A FLEXIBLE BUDGET Harrald's Fish House is a familyowned restaurant that specializes in Scandinavianstyle seafood. Data concerning the restaurant's monthly revenues
More informationDiscrete Random Variables and their Probability Distributions
CHAPTER 5 Discrete Random Variables and their Probability Distributions CHAPTER OUTLINE 5.1 Probability Distribution of a Discrete Random Variable 5.2 Mean and Standard Deviation of a Discrete Random Variable
More informationCS 147: Computer Systems Performance Analysis
CS 147: Computer Systems Performance Analysis Introduction to Queueing Theory CS 147: Computer Systems Performance Analysis Introduction to Queueing Theory 1 / 27 Overview Introduction and Terminology
More information