C – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Waiting Lines C For Operations Management, 9e by Krajewski/Ritzman/Malhotra.

Slides:



Advertisements
Similar presentations
© 2007 Pearson Education Waiting Lines Supplement C.
Advertisements

Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models.
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
QMD: Waiting-line analysis
D Waiting-Line Models PowerPoint presentation to accompany
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Waiting Lines and Queuing Theory Models
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Queuing Systems Chapter 17.
Waiting Line Models And Service Improvement
Waiting Lines Students should be able to:
Waiting Line Analysis OPIM 310-Lecture 3 Instructor: Jose Cruz.
Lecture 11 Queueing Models. 2 Queueing System  Queueing System:  A system in which items (or customers) arrive at a station, wait in a line (or queue),
Management of Waiting Lines
14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.
Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 16 Waiting Line Models and.
Chapter 18 Management of Waiting Lines
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Waiting.
Operations Management Waiting-Line Models Module D
Chapter 9: Queuing Models
WAITING LINES The study of waiting lines, called queuing theory, is one of the most widely used and oldest management science techniques. The three basic.
MNG221 - Management Science –
Queuing Models and Capacity Planning
© 2008 Prentice Hall, Inc.D – 1 Operations Management Module D – Waiting-Line Models PowerPoint presentation to accompany Heizer/Render Principles of Operations.
D Waiting-Line Models PowerPoint presentation to accompany
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Operations Management
Operations Management
Introduction to Management Science
MBA 8452 Systems and Operations Management MBA 8452 Systems and Operations Management Product Design & Process Selection —Service.
Queueing Theory Models Training Presentation By: Seth Randall.
D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Operations Management Waiting-Line Models Module D.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Advanced Waiting Line Theory and Simulation Modeling Chapter 6 - Supplement.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Supplement D Waiting Line Models Operations Management by R. Dan Reid & Nada R. Sanders 3rd Edition © Wiley 2005 PowerPoint Presentation by Roger B. Grinde,
Queuing Models. © 2002 Prentice-Hall, IncCh 9-2 Stay in Queue: Short Video &feature=related
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Supplement C Waiting Line Models Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 18 Management of Management of Waiting Lines.
18 Management of Waiting Lines.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
 One or more ‘customers’ waiting for a service.  ‘Customer’ can be: › People e.g. A person waiting in line to deposit cash in a bank. › Objects e.g.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Chapter 16 Capacity Planning and Queuing Models
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
Supplement D Waiting Line Models
Advance Waiting Line Theory and Simulation Modeling.
Waiting Lines Supplement B
Reid & Sanders, Operations Management © Wiley 2002 Waiting Line Models A SUPPLEMENT.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Waiting Lines and Queuing Theory Models
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Waiting Line Models Production and Operations Management Reporter:
1 1 Slide Chapter 12 Waiting Line Models n The Structure of a Waiting Line System n Queuing Systems n Queuing System Input Characteristics n Queuing System.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Queuing Models.
Queueing Theory/Waiting Line: Models and Analysis Navneet Vidyarthi
14 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Operations Planning and Scheduling 14 For Operations Management, 9e by Krajewski/Ritzman/Malhotra.
Module D Waiting Line Models.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
© 2006 Prentice Hall, Inc.D – 1 Operations Management Module D – Waiting-Line Models © 2006 Prentice Hall, Inc. PowerPoint presentation to accompany Heizer/Render.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Chapter 9: Queuing Models
Supplement D Waiting Line Models
Presentation transcript:

C – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Waiting Lines C For Operations Management, 9e by Krajewski/Ritzman/Malhotra © 2010 Pearson Education PowerPoint Slides by Jeff Heyl

C – 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Why Waiting Lines Form Define customers Waiting lines form  Temporary imbalance between demand and capacity  Can develop even if processing time is constant No waiting line if both demand and service rates are constant and service rate > than demand Affects process design, capacity planning, process performance, and ultimately, supply chain performance

C – 3 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Uses of Waiting-Line Theory Applies to many service or manufacturing situations  Relating arrival and service-system processing characteristics to output Service is the act of processing a customer  Hair cutting in a hair salon  Satisfying customer complaints  Processing production orders  Theatergoers waiting to purchase tickets  Trucks waiting to be unloaded at a warehouse  Patients waiting to be examined by a physician

C – 4 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Structure of Waiting-Line Problems 1.An input, or customer population, that generates potential customers 2.A waiting line of customers 3.The service facility, consisting of a person (or crew), a machine (or group of machines), or both necessary to perform the service for the customer 4.A priority rule, which selects the next customer to be served by the service facility

C – 5 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Structure of Waiting-Line Problems Customer population Service system Waiting line Priority rule Service facilities Served customers Figure C.1 – Basic Elements of Waiting-Line Models

C – 6 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Customer Population The source of input Customers are patient or impatient  Patient customers wait until served  Impatient customer either balk or join the line and renege Finite or infinite source  Customers from a finite source reduce the chance of new arrivals  Customers from an infinite source do not affect the probability of another arrival

C – 7 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. The Service System Number of lines  A single-line keeps servers uniformly busy and levels waiting times among customers  A multiple-line arrangement is favored when servers provide a limited set of services Arrangement of service facilities  Single-channel, single-phase  Single-channel, multiple-phase  Multiple-channel, single-phase  Multiple-channel, multiple-phase  Mixed arrangement

C – 8 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Service facilities (a) Single line Service facilities (b) Multiple lines The Service System Figure C.2 –Waiting-Line Arrangements

C – 9 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. The Service System Service facility (a) Single channel, single phase (b) Single channel, multiple phase Service facility 1 Service facility 2 Figure C.3 –Examples of Service Facility Arrangements

C – 10 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. (c) Multiple channel, single phase Service facility 1 Service facility 2 The Service System Service facility 3 Service facility 4 Service facility 1 Service facility 2 (d) Multiple channel, multiple phase Figure C.3 –Examples of Service Facility Arrangements

C – 11 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. The Service System Routing for : 1–2–4 Routing for : 2–4–3 Routing for : 3–2–1–4 (e) Mixed arrangement Service facility 1 Service facility 4 Service facility 3 Service facility 2 Figure C.3 –Examples of Service Facility Arrangements

C – 12 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Priority Rule First-come, first-served (FCFS)—used by most service systems Preemptive discipline—allows a higher priority customer to interrupt the service of another customer or be served ahead of another who would have been served first Other rules  Earliest due date (EDD)  Shortest processing time (SPT)

C – 13 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Probability Distributions The sources of variation in waiting-line problems come from the random arrivals of customers and the variation of service times Arrival distribution  Customer arrivals can often be described by the Poisson distribution with mean = T and variance also = T  Arrival distribution is the probability of n arrivals in T time periods  Interarrival times are the average time between arrivals

C – 14 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. P n = e - T for n = 0, 1, 2,… ( T) n n ! Interarrival Times where P n =Probability of n arrivals in T time periods =Average numbers of customer arrivals per period e =2.7183

C – 15 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Probability of Customer Arrivals EXAMPLE C.1 Management is redesigning the customer service process in a large department store. Accommodating four customers is important. Customers arrive at the desk at the rate of two customers per hour. What is the probability that four customers will arrive during any hour? SOLUTION In this case customers per hour, T = 1 hour, and n = 4 customers. The probability that four customers will arrive in any hour is P 4 = = e –2 = [2(1)] 4 4! e –2(1)

C – 16 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. P ( t ≤ T) = 1 – e -  T where μ =average number of customers completing service per period t =service time of the customer T =target service time Service Time Service time distribution can be described by an exponential distribution with mean = 1/  and variance = (1/  ) 2 Service time distribution: The probability that the service time will be no more than T time periods can be described by the exponential distribution

C – 17 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Service Time Probability EXAMPLE C.2 The management of the large department store in Example C.1 must determine whether more training is needed for the customer service clerk. The clerk at the customer service desk can serve an average of three customers per hour. What is the probability that a customer will require less than 10 minutes of service? SOLUTION We must have all the data in the same time units. Because  = 3 customers per hour, we convert minutes of time to hours, or T = 10 minutes = 10/60 hour = hour. Then P ( t ≤ T) = 1 – e –  T P ( t ≤ hour) = 1 – e –3(0.167) = 1 – 0.61 = 0.39

C – 18 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Using Waiting-Line Models Balance costs against benefits Operating characteristics  Line length  Number of customers in system  Waiting time in line  Total time in system  Service facility utilization

C – 19 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Single-Server Model Single-server, single line of customers, and only one phase Assumptions are 1.Customer population is infinite and patient 2.Customers arrive according to a Poisson distribution, with a mean arrival rate of 3.Service distribution is exponential with a mean service rate of  4.Mean service rate exceeds mean arrival rate 5.Customers are served FCFS 6.The length of the waiting line is unlimited

C – 20 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.  = Average utilization of the system =  L = Average number of customers in the service system =  –  L q = Average number of customers in the waiting line =  L W = Average time spent in the system, including service = 1  –  W q = Average waiting time in line =  W  n = Probability that n customers are in the system = (1 –  )   n Single-Server Model

C – 21 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Calculating the Operating Characteristics EXAMPLE C.3 The manager of a grocery store in the retirement community of Sunnyville is interested in providing good service to the senior citizens who shop in her store. Currently, the store has a separate checkout counter for senior citizens. On average, 30 senior citizens per hour arrive at the counter, according to a Poisson distribution, and are served at an average rate of 35 customers per hour, with exponential service times. Find the following operating characteristics: a.Probability of zero customers in the system b.Average utilization of the checkout clerk c.Average number of customers in the system d.Average number of customers in line e.Average time spent in the system f.Average waiting time in line

C – 22 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Calculating the Operating Characteristics SOLUTION The checkout counter can be modeled as a single-channel, single-phase system. Figure C.4 shows the results from the Waiting-Lines Solver from OM Explorer. Figure C.4 –Waiting-Lines Solver for Single-Channel, Single-Phase System

C – 23 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Calculating the Operating Characteristics Both the average waiting time in the system ( W ) and the average time spent waiting in line ( Wq ) are expressed in hours. To convert the results to minutes, simply multiply by 60 minutes/ hour. For example, W = 0.20(60) minutes, and Wq = (60) = minutes.

C – 24 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.1 Customers arrive at a checkout counter at an average 20 per hour, according to a Poisson distribution. They are served at an average rate of 25 per hour, with exponential service times. Use the single-server model to estimate the operating characteristics of this system. = 20 customer arrival rate per hour  = 25 customer service rate per hour SOLUTION 1.Average utilization of system ==  = =

C – 25 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.1 2.Average number of customers in the service system = = – 20 L =  –  L q =  L W = 1  –  W q =  W 3.Average number of customers in the waiting line = 0.8(4) = Average time spent in the system, including service = = – 20 5.Average waiting time in line= 0.8(0.2) = 0.16

C – 26 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Analyzing Service Rates EXAMPLE C.4 The manager of the Sunnyville grocery in Example C.3 wants answers to the following questions: a.What service rate would be required so that customers average only 8 minutes in the system? b.For that service rate, what is the probability of having more than four customers in the system? c.What service rate would be required to have only a 10 percent chance of exceeding four customers in the system?

C – 27 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Analyzing Service Rates SOLUTION The Waiting-Lines Solver from OM Explorer could be used iteratively to answer the questions. Here we show how to solve the problem manually. a.We use the equation for the average time in the system and solve for  W = 1  – 8 minutes = hour = 1  –  – 0.133(30) = 1  = customers/hour

C – 28 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Analyzing Service Rates b.The probability of more than four customers in the system equals 1 minus the probability of four or fewer customers in the system. P = 1 –  P n 4 n = 0 = 1 –  (1 –  )  n 4 n = 0  = = and Then, P = 1 – 0.21( ) = 1 – = Therefore, there is a nearly 33 percent chance that more than four customers will be in the system.

C – 29 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Analyzing Service Rates c.We use the same logic as in part (b), except that  is now a decision variable. The easiest way to proceed is to find the correct average utilization first, and then solve for the service rate. P = 1 – (1 –  )(1 +  +  2 +  3 +  4 ) = 1 – (1 –  )(1 +  +  2 +  3 +  4 ) +  (1 +  +  2 +  3 +  4 ) = 1 – 1 –  –  2 –  3 –  4 +  +  2 +  3 +  4 +  5 =  5  = P 1/5 or If P = 0.10  = (0.10) 1/5 = 0.63

C – 30 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Analyzing Service Rates Therefore, for a utilization rate of 63 percent, the probability of more than four customers in the system is 10 percent. For = 30, the mean service rate must be  = customers/hour = 

C – 31 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.2 In the checkout counter example, what service rate is required to have customers average only 10 minutes in the system? SOLUTION W = 1  –  = 0.17 hr (or 10 minutes) 0.17(  – ) = 1, where = 20 customers arrival rate per hour  = = or about 26 customers per hour (20) 0.17

C – 32 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Multiple-Server Model Service system has only one phase, multiple-channels Assumptions (in addition to single-server model)  There are s identical servers  The service distribution for each server is exponential  The mean service time is 1/   s  should always exceed

C – 33 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Multiple-Server Model P 0 = Probability that zero customers are in the system = P n = Probability that n customers are in the system =  = Average utilization of the system =

C – 34 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Multiple-Server Model L q = Average number of customers in the waiting line = W q = Average waiting time of customers in line = W = Average time spent in the system, including service = = W L = Average number of customers in the service system

C – 35 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Estimating Idle Time and Costs EXAMPLE C.5 The management of the American Parcel Service terminal in Verona, Wisconsin, is concerned about the amount of time the company’s trucks are idle (not delivering on the road), which the company defines as waiting to be unloaded and being unloaded at the terminal. The terminal operates with four unloading bays. Each bay requires a crew of two employees, and each crew costs $30 per hour. The estimated cost of an idle truck is $50 per hour. Trucks arrive at an average rate of three per hour, according to a Poisson distribution. On average, a crew can unload a semitrailer rig in one hour, with exponential service times. What is the total hourly cost of operating the system?

C – 36 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Estimating Idle Time and Costs SOLUTION The multiple-server model is appropriate. To find the total cost of labor and idle trucks, we must calculate the average number of trucks in the system. Figure C.5 shows the results for the American Parcel Service problem using the Waiting-Lines Solver from OM Explorer. Manual calculations using the equations for the multiple-server model are demonstrated in Solved Problem 2 at the end of this supplement. The results show that the four-bay design will be utilized 75 percent of the time and that the average number of trucks either being serviced or waiting in line is 4.53 trucks. That is, on average at any point in time, we have 4.53 idle trucks. We can now calculate the hourly costs of labor and idle trucks:

C – 37 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Estimating Idle Time and Costs Labor cost:$30( s ) = $30(4)=$ Idle truck cost:$50( L ) = $50(4.53)= Total hourly cost=$ Figure C.5 –Waiting-Lines Solver for Multiple-Server Model

C – 38 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.3 Suppose the manager of the checkout system decides to add another counter. The arrival rate is still 20 customers per hour, but now each checkout counter will be designed to service customers at the rate of 12.5 per hour. What is the waiting time in line of the new system? s = 2,  = 12.5 customers per hour, = 20 customers per hour SOLUTION  = 1.Average utilization of the system = = 0.8

C – 39 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.3 2.Probability that zero customers are in the system P 0 = = = 0.11

C – 40 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.3 3.Average number of customers in the waiting line W q = L q = = = Average waiting time of customers in line = = hrs (or minutes

C – 41 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Little’s Law Relates the number of customers in a waiting line system to the waiting time of customers Using the notation from the single-server and multiple-server models it is expressed as L = W or L q = W q Holds for a wide variety of arrival processes, service time distributions, and numbers of servers Only need to know two of the parameters

C – 42 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Little’s Law Service  Estimate W Manufacturing  Estimate the average work-in-process L Average time in the facility = W = L customers customer/hour = = 0.75 hours or 45 minutes Work-in-process = L = W = 5 gear cases/hour (3 hours) = 15 gear cases

C – 43 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Little’s Law Provides basis for measuring the effects of process improvements Is not applicable to situations where the customer population is finite

C – 44 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Finite-Source Model Assumptions  Follows the assumption of the single-server, except that the customer population is finite  Having only N potential customers  If N > 30, then the single-server model with the assumption of infinite customer population is adequate

C – 45 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Finite-Source Model P 0 = Probability that zero customers are in the system =  = Average utilization of the server = 1 – P 0 L q = Average number of customers in the waiting line =

C – 46 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Finite-Source Model L = Average number of customers in the service system = W q = Average waiting time in line = W = Average time spent in the system, including service =

C – 47 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.4 DBT Bank has 8 copy machines located in various offices throughout the building. Each machine is used continuously and has an average time between failures of 50 hours. Once failed, it takes 4 hours for the service company to send a repair person to have it fixed. What is the average number of copy machines in repair or waiting to be repaired? = 1/50 = 0.02 copiers per hour  = 1/4 = 0.25 copiers per hour

C – 48 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.4 SOLUTION 1.Probability that zero customers are in the system P 0 = = = Average utilization of the server  = 1 – P 0 = 1 – 0.44 = Average number of customers in the service system L = = = 1

C – 49 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Analyzing Maintenance Costs EXAMPLE C.6 The Worthington Gear Company installed a bank of 10 robots about 3 years ago. The robots greatly increased the firm’s labor productivity, but recently attention has focused on maintenance. The firm does no preventive maintenance on the robots because of the variability in the breakdown distribution. Each machine has an exponential breakdown (or interarrival) distribution with an average time between failures of 200 hours. Each machine hour lost to downtime costs $30, which means that the firm has to react quickly to machine failure. The firm employs one maintenance person, who needs 10 hours on average to fix a robot. Actual maintenance times are exponentially distributed. The wage rate is $10 per hour for the maintenance person, who can be put to work productively elsewhere when not fixing robots. Determine the daily cost of labor and robot downtime.

C – 50 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Analyzing Maintenance Costs SOLUTION The finite-source model is appropriate for this analysis because the customer population consists of only 10 machines and the other assumptions are satisfied. Here, = 1/200, or break- down per hour, and  = 1/10 = 0.10 robot per hour. To calculate the cost of labor and robot downtime, we need to estimate the average utilization of the maintenance person and L, the average number of robots in the maintenance system at any time. Figure C.6 shows the results for the Worthington Gear Problem using the Waiting-Lines Solver from OM Explorer.

C – 51 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Analyzing Maintenance Costs Manual computations using the equations for the finite-source model are demonstrated in Solved Problem 3 at the end of this supplement. The results show that the maintenance person is utilized only 46.2 percent of the time, and the average number of robots waiting in line or being repaired is 0.76 robot. However, a failed robot will spend an average of hours in the repair system, of which 6.43 hours of that time is spent waiting for service. While an individual robot may spend more than two days with the maintenance person, the maintenance person has a lot of idle time with a utilization rate of only 42.6 percent. That is why there is only an average of 0.76 robot being maintained at any point of time.

C – 52 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Analyzing Maintenance Costs Figure C.5 –Waiting-Lines Solver for Finite-Source Model The daily cost of labor and robot downtime is Labor cost:($19/hour)(8 hours/day)(0.462 utilization)=$36.96 Idle robot cost:(0.76 robot)($30/robot hour)(8 hours/day)= Total daily cost=$219.36

C – 53 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.5 The Hilltop Produce store is staffed by one checkout clerk. The average checkout time is exponentially distributed around an average of two minutes per customer. An average of 20 customers arrive per hour. What is the average utilization rate? SOLUTION ==  = =

C – 54 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.5 What is the probability that three or more customers will be in the checkout area? First calculate 0, 1, and 2 customers will be in the checkout area:  n = (1 –  )  0 = (0.333)(0.667) 0 =  n = (1 –  )  1 = (0.333)(0.667) 1 =  n = (1 –  )  2 = (0.333)(0.667) 2 = Then calculate 3 or more customers will be in the checkout area: 1 – P 0 – P 1 – P 2 = – – = 0.334

C – 55 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Application C.5 What is the average number of customers in the waiting line?  –  L q =  L =  = = What is the average time customers spend in the store? W = 1  –  = = 0.1 hr  60 min/hr = 6 minutes

C – 56 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Decision Areas for Management 1.Arrival rates 2.Number of service facilities 3.Number of phases 4.Number of servers per facility 5.Server efficiency 6.Priority rule 7.Line arrangement

C – 57 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Solved Problem 1 A photographer takes passport pictures at an average rate of 20 pictures per hour. The photographer must wait until the customer smiles, so the time to take a picture is exponentially distributed. Customers arrive at a Poisson-distributed average rate of 19 customers per hour. a.What is the utilization of the photographer? b.How much time will the average customer spend with the photographer? SOLUTION a.The assumptions in the problem statement are consistent with a single-server model. Utilization is ==  = =

C – 58 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Solved Problem 1 b.The average customer time spent with the photographer is W=W= 1  –  = = 1 hour 1 20 – 19

C – 59 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Solved Problem 2 The Mega Multiplex Movie Theater has three concession clerks serving customers on a first come, first-served basis. The service time per customer is exponentially distributed with an average of 2 minutes per customer. Concession customers wait in a single line in a large lobby, and arrivals are Poisson distributed with an average of 81 customers per hour. Previews run for 10 minutes before the start of each show. If the average time in the concession area exceeds 10 minutes, customers become dissatisfied. a. What is the average utilization of the concession clerks? b. What is the average time spent in the concession area?

C – 60 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Solved Problem 2 SOLUTION  = = = 0.90 The concession clerks are busy 90 percent of the time. a.The problem statement is consistent with the multiple-server model, and the average utilization rate is

C – 61 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Solved Problem 2 b.The average time spent in the system, W, is W = Here, W q = L q = P 0 = and We must solve for P 0, L q, and W q, in that order, before we can solve for W : P 0 = = = = =

C – 62 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Solved Problem 2 L q = = customers== W q = == hour W = = hours + hour = = 7.45 minutes With three concession clerks, customers will spend an average of 7.45 minutes in the concession area.

C – 63 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Solved Problem 3 The Severance Coal Mine serves six trains having exponentially distributed interarrival times averaging 30 hours. The time required to fill a train with coal varies with the number of cars, weather-related delays, and equipment breakdowns. The time to fill a train can be approximated by an exponential distribution with a mean of 6 hours 40 minutes. The railroad requires the coal mine to pay large demurrage charges in the event that a train spends more than 24 hours at the mine. What is the average time a train will spend at the mine? SOLUTION The problem statement describes a finite-source model, with N = 6. The average time spent at the mine is W = L [( N – L ) ]–1, with 1/ = 30 hours/train, = 0.8 train/day, and  = 3.6 trains/day. In this case,

C – 64 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Solved Problem 3 P 0 = = = 1 = = = L = W = == trains == 0.72 day Arriving trains will spend an average of 0.72 day at the coal mine.

C – 65 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.