Problem 8.4 K = ∞ R i = 60/4 = 15 /hr T p = 3 min = 0.05 hour c= 1 R p = c/Tp = 20 /hour Both Ti and Tp exponential Server $20 /hr Phone $5/hr Wait cost.

Slides:



Advertisements
Similar presentations
Operations Management
Advertisements

Waiting Lines CrossChek Sporting Goods’ Golf Division gets requests-for- quotes for custom-made golf clubs at a rate of about 4 per hour. Each of these.
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Module C8 Queuing Economic/Cost Models. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some.
Capacity Setting and Queuing Theory
S. D. Deshmukh OM V. Capacity Planning in Services u Matching Supply and Demand u The Service Process u Performance Measures u Causes of Waiting u Economics.
INDR 343 Problem Session
Waiting Lines Example Students arrive at the Administrative Services Office at an average of one every 15 minutes, and their request take on average 10.
1 Ardavan Asef-Vaziri Jan-2011Operations Management: Waiting Lines 2 Bank of San Pedro has only 1 teller. On average, 1 customer comes every 6 minutes,
Waiting Lines CrossChek Sporting Goods’ Golf Division gets requests-for- quotes for custom-made golf clubs at a rate of about 4 per hour. Each of these.
Readings Readings Chapter 11, Sections 1, 2, 3, 5 Waiting Line Models.
S. Chopra/Operations/Managing Services1 Operations Management: Capacity Management in Services Module u Why do queues build up? u Process attributes and.
Queuing Models M/M/k Systems. CLASSIFICATION OF QUEUING SYSTEMS Recall that queues are classified by (Arrival Dist.)/(Service Dist.)/(# servers) Designations.
1 Ardavan Asef-Vaziri Jan-2011Operations Management: Waiting Lines 2 The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.
Waiting Lines Example-1
Probability Distributions
1 Ardavan Asef-Vaziri Jan-2011Operations Management: Waiting Lines 2 Example: The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.
Queuing Models Economic Analyses. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some service.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of.
Queuing Systems Chapter 17.
Multiple server queues In particular, we look at M/M/k Need to find steady state probabilities.
Waiting Line Models And Service Improvement
Chapter 13 Queuing Theory
Queueing Theory Chapter 17.
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),
Polling: Lower Waiting Time, Longer Processing Time (Perhaps)
MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-4670: Computer Communications Netwoks Exam 2: Solutions Time: 75 min (strictly enforced)
OM&PM/Class 6b1 1Operations Strategy 2Process Analysis 3Lean Operations 4Supply Chain Management 5Capacity Management in Services –Class 6b: Capacity Analysis.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
Waiting Line Analysis for Service Improvement
MNG221 - Management Science –
Buffer or Suffer Principle
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
OPSM 301: Operations Management
Spreadsheet Modeling & Decision Analysis
1 1 Slide © 2005 Thomson/South-Western Chapter 12, Part A Waiting Line Models n Structure of a Waiting Line System n Queuing Systems n Queuing System Input.
Exponential Distribution
A spinner from a board game randomly indicates a real number between 0 and 50. The spinner is fair in the sense that it indicates a number in a given interval.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Make to stock vs. Make to Order
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Slide 1 Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted.
MGTSC 352 Lecture 25: Congestion Management MEC example Manufacturing example.
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Mean inter-arrival time = 1/Ri = 1/R  Probability that the time between two arrivals.
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.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3 Example: The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.
Trauma center moves to diversion status once all servers are busy (incoming patients are directed to other locations) Figure 7.1.: Process flow diagram.
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.
Example 14.3 Queuing | 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n County Bank has several.
1 Safety Capacity Capacity Planning in Services Industry  Matching Supply and Demand in Service Processes  Performance Measures  Causes of Waiting 
1 Ardavan Asef-Vaziri Jan-2011Operations Management: Waiting Lines 2 Example: The average arrival rate to a GAP store is 6 customers per hour. The average.
Module D Waiting Line Models.
Lin/Operations/Managing Services1 Capacity Management in Services Module u Queuing processes and performance measures u Why do queues build up? u Performance.
18 Management of Waiting Lines
Managing Flow Variability: Safety Capacity
Queuing Models Economic Analyses.
Effect of Buffer Capacity
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
LESSON 12: EXPONENTIAL DISTRIBUTION
DECISION MODELING WITH Prentice Hall Publishers and
Problem 8.3 John Doe has promised a total service time of 20 minutes. Processing time at the oven = 15 min Preparation = 2 min At most 3 minutes waiting.
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
On average, there are 3(4.42) =13.26 claims waiting be processed.
Effect of Buffer Capacity
Presentation transcript:

Problem 8.4 K = ∞ R i = 60/4 = 15 /hr T p = 3 min = 0.05 hour c= 1 R p = c/Tp = 20 /hour Both Ti and Tp exponential Server $20 /hr Phone $5/hr Wait cost $120/person/hr a4) the total hourly cost of service and waiting 75% of time CSR will be busy a2) the proportion of time that CSR will be busy a3) the average number of customers on line

We know the formula for I i, what about I p ? Why ρ customers in the server? In this example with ρ = 0.75 Suppose we check the CSR at 100 random times. On average on how many times is s/he is talking to a customer? 75% one customer, 25% no customer. On average 0.75 customer are in the server. a4) the total hourly cost of service and waiting The costs include the CSR wages and the cost of waiting (line charge + waiting cost for customers). Service cost = 20+5 = 25/hr Waiting cost = 2.25(120) = 270/hr Total cost = 295 /hr Problem 8.4 K = ∞ R i = 60/4 = 15 /hr T p = 3 min = 0.05 hour c= 1 R p = c/Tp = 20 /hour Both Ti and Tp exponential Server $20 /hr Phone $5/hr Wait cost $120/person/hr In a single server ρ customer are served, in multi server cρ customers I p = c ρ

b) Compute service cost, waiting cost, blocking cost K = ∞  K= 4 With only four lines and one CSR,  c = 1, Maximum buffer size K = 3. Using the spreadsheet Performance.xls Average waiting time Ti = 3.45 mins, Average # of customers on hold Ii = 0.77, (in K = ∞, Ii was 2.25) Average number of customers in system is still I = 1.44, Probability of blocking = Ip is still equal to ρ but ρ is not.75 any more In this case the costs incurred are the CSR wages, the cost of waiting (line charge + waiting cost for customers) and the lost business because of blocked calls. We have Hourly wages of CSR = $20 / hour, Line charge = $5 / hour, Customer waiting cost =.77  120 = $92.4, Cost of blocking = Calls blocked per hour  $100 = Probability of blocking  Average arrival rate  $100 =  15  $100 = $156. This implies that Total hourly cost = $20 + $5 + $ $156 = $273.4.

c1) How would it affect customer waiting time? C2) What is the economic impact of adding another line. Adding one line  K = 4 all other parameters remain the same. Using the Performance.xls spreadsheet Ti = 4.33 mins, Ii = 1.005, Average number of customers in system I = 1.70, Probability of blocking = Customer waiting cost =  120 = $120.6, Cost of blocking = Calls blocked per hour  $100 = Probability of blocking  Average arrival rate  $100 =  15  $100 = $108. Excluding the cost of the new line we have Total cost per hour = $20 + $5 + $ $108 = $ As long as the cost of the new line is less than $273.4 (cost with 4 lines) - $253.6 (cost with 3 lines) = $19.8 / hour, it pays to install the new line.

d) Beside adding a new line, also add a CSR. Two servers and five lines Average arrival rate Ri = 1/4 per minute, Average unit capacity 1/Tp = 1/3 per minute, Number of servers c = 2, Maximum buffer size K = 3. Using the Performance.xls spreadsheet we get Average waiting time Ti = 0.42 mins, Average # of customers on hold Ii = Average number of customers in system I = 0.85, Probability of blocking = Service cost = / hour, Waiting cost =.105  120 = $12.6, Blocking cost = Probability of blocking  Average arrival rate  $100 =  15  $100 = $10.5. Hourly cost of system = $40 + $5 + $ $10.5 = $68.1/hour. This is a significant reduction in cost. The new CSR should thus be hired.