OMG 402 - Operations Management Spring 1997 CLASS 6: Process Design and Performance Measurement Harry Groenevelt.

Slides:



Advertisements
Similar presentations
Operations Management
Advertisements

E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
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.
OMG Operations Management Spring 1997
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines1  Understanding the phenomenon of waiting  Measures.
OPSM 405 Service Management Class 19: Managing waiting time: Queuing Theory Koç University Zeynep Aksin
Queueing Theory: Recap
Queuing Theory For Dummies
Queuing Models Basic Concepts
Previously Optimization Probability Review Inventory Models Markov Decision Processes.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of.
Chapter 13 Queuing Theory
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
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),
Data Communication and Networks Lecture 13 Performance December 9, 2004 Joseph Conron Computer Science Department New York University
1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.
Management of Waiting Lines
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
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
Rensselaer Polytechnic Institute © Shivkumar Kalvanaraman & © Biplab Sikdar1 ECSE-4730: Computer Communication Networks (CCN) Network Layer Performance.
Chapter 18 Management of Waiting Lines
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Operations Management Waiting-Line Models Module D
Introduction to Queuing Theory. 2 Queuing theory definitions  (Kleinrock) “We study the phenomena of standing, waiting, and serving, and we call this.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
QUEUING MODELS Queuing theory is the analysis of waiting lines It can be used to: –Determine the # checkout stands to have open at a store –Determine the.
OPSM 301: Operations Management
Spreadsheet Modeling & Decision Analysis
MBA 8452 Systems and Operations Management MBA 8452 Systems and Operations Management Product Design & Process Selection —Service.
ISM 270 Service Engineering and Management Lecture 7: Forecasting and Managing Service Capacity.
Network Analysis A brief introduction on queues, delays, and tokens Lin Gu, Computer Networking: A Top Down Approach 6 th edition. Jim Kurose.
Introduction to Queuing Theory
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Introduction to Operations Research
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Queueing Analysis of Production Systems (Factory Physics)
18 Management of Waiting Lines.
TexPoint fonts used in EMF.
1 Elements of Queuing Theory The queuing model –Core components; –Notation; –Parameters and performance measures –Characteristics; Markov Process –Discrete-time.
M/M/1 queue λn = λ, (n >=0); μn = μ (n>=1) λ μ λ: arrival rate
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.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
OMG Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt.
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
OPSM 301: Operations Management Session 19: Flow variability Koç University Zeynep Aksin
OMSAN LOJİSTİK. Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis.
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
CS352 - Introduction to Queuing Theory Rutgers University.
Computer Networking Queueing (A Summary from Appendix A) Dr Sandra I. Woolley.
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.
1 Queuing Delay and Queuing Analysis. RECALL: Delays in Packet Switched (e.g. IP) Networks End-to-end delay (simplified) = End-to-end delay (simplified)
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Managerial Decision Making Chapter 13 Queuing Models.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
Managing Flow Variability: Safety Capacity
Management of Waiting Lines
Queueing Theory Carey Williamson Department of Computer Science
Variability 8/24/04 Paul A. Jensen
Queuing Theory By: Brian Murphy.
Queuing Models and Capacity Planning
Carey Williamson Department of Computer Science University of Calgary
Presentation transcript:

OMG Operations Management Spring 1997 CLASS 6: Process Design and Performance Measurement Harry Groenevelt

2 Agenda Recap –Basic Queuing Relationships –Modeling a Distributed Queue The Impact of Variability ‘Limited Space’ Systems and Performance Measure Trade-offs Capacity Strategy and Queuing Management Summary of Insights

3 Servers (s) system queue departures arrivals ( customers/hr)  customers/hr/server Recap: Basic Queuing Relationships avg. # in system = (avg. # in queue) + (avg. # in service) avg. # in service = (# of servers) * (utilization) avg. time in system = (avg. time in queue) + (avg. service time) … and remember Little’s Law!

4 Recap: Basic Queueing Relationships M/M/1 Queue: –Special service time and inter-arrival time distributions (a ‘memoryless’ process) –Single Server –Average time in system = 1/(  – ) –Average number in system = /(  - ) =  /(1–  )

5 Recap: Basic Queuing Relationships M/M/s Queue: –Again, memoryless arrival and service times –‘s’ servers –Results via QMacros G/G/s Queue: –When arrivals or service times are not of this ‘special’ type –Results via QMacros

6 Recap: Modeling a Distributed Queue The On-Call Computer Consultant Customer arrives by telephone. Information for Queue: appointment book of the consultant Physical Queue: Customers’ Offices What is the ‘server’?

7 Recap: Modeling a Distributed Queue The On-Call Computer Consultant When does service begin and end? Customer point of view: Consultant (server) point of view: For QMacros, service time =

8 Recap: Impact of variability (G/G/s) Using QMACROS –For arrival process specify: Arrival Rate Coefficient of Variation of inter-arrival time distribution (cv(A)) –For service time distribution specify: Service Rate Coefficient of Variation of service time distribution (cv(S))

9 Recap: Impact of variability Reminder: if X is a random variable with mean  and std. dev , then its Coefficient of Variation = cv(X) =  /  For exponential random variables: –Coefficient of Variation = 1 For deterministic random variables: –Coefficient of Variation = 0

10 Recap: approximate G/G/1 formula An approximation for average wait in queue that works well for ‘congested’ systems: W q (G/G/1) = 0.5 * (cv(A) 2 +cv(S) 2 ) * W q (M/M/1) Use QMacros to analyze G/G/s

11 check-in booths queue in lobby of convention hall departures arrivals step off of tour buses from the hotel Typical tasks at check-in: ask for name and check for registration look up registration number check off list hand over packet Even with seemingly plenty of booths we observe long queues. Why? Impact of Variability: An Example Check-in for an Operations Management Convention in Morocco Original Physical Arrangement:

12 arrivals step off of tour buses from the hotel Impact of Variability: An Example Check-in for an Operations Management Convention in Morocco Revised Arrangement: A-G H-P Q-Z check-in booths departures arrivals check pre- registration information on posted computer printouts What are the advantages of this system? What are the disadvantages?

13 What systems can be modeled this way? Limited Space Systems M/M/s/N (‘limited space’) system –Same as M/M/s system, except: –Assumes only N positions available –An arriving customer who finds all N positions occupied leaves without waiting and without receiving service N in System? Queue Server 1 Server s Customer Arrival Departures Leave Without Service

14 Limited Space Systems: Performance Measures Fraction Not Served: fraction of arrivals not served because they found all N positions in the system occupied Throughput: the rate at which customers are served by the system Load Factor: arrival rate/total capacity (how is this different from utilization?)

15 Limited Space Systems: Performance Measures Throughput = Arrival Rate * (1– Fraction Not Served) All other performance measures (time in system, etc.) are for served customers only, and satisfy all the relationships we’ve seen. Similar measures for M/M/s/I system with impatient customers.

16 (see: Frontiers of Electronic Commerce by Profs. Kalakota and Whinston) Limited Space Systems Example: Local Internet Service Provider (ISP) N trunk lines (all customers ‘arrive’ by same-number dialup) national ISP and Internet Backbone calls may queue for a modem here Switch Terminal server Router Modem Farm modem 1 modem 2 modem 3 modem s

17 Limited Space System: Local ISP Each caller uses one trunk line and one modem Arriving caller waits on a trunk line if all S modems are used Arriving caller busied out if N trunk lines used lines logged onto s modemsN–s lines (virtual queue) N trunk lines

18 Performance measure trade-offs Consider the system with high utilization (i.e., AOL at peak hours!) As we decrease the number of trunk lines: What happens to fraction not served (busied out)? What happens to average wait in queue?

19 (28 modems, 35 trunk lines, average session length: 20 minutes) Performance measures trade-off Now hold the number of trunk lines constant and increase arrival rate: Arrival Rate (1/min) Average Wait to Log On (minutes) 0% 20% 40% 60% 80% 100% Percent Receiving Busy Signals Fraction Busy Signals (see scale on the right) Avg Wait to Log On (see scale on the left)

20 Performance measures trade-off As demand increases but capacity does not keep pace: –wait in queue increases but is limited by available space; –percentage busied-out (not served) increases up to 100%. –When load factors are high, customers must go somewhere!

21 Subscriptions to AOL, Jun-94Dec-94Jun-95Dec-95Jun-96Dec-96 Number of Subscribers (millions) January, 1997 December, 1996 (flat-rate access introduced) source: Jupiter Communications and the Los Angeles Times Capacity Strategy: America Online

22 Capacity Strategy: Expansionist Jun-94Dec-94Jun-95Dec-95Jun-96Dec-96 Number of Subscribers (millions) Modem Capacity Nr of Subscribers

Jun-94Dec-94Jun-95Dec-95Jun-96Dec-96 Number of Subscribers (millions) Capacity Strategy: Wait-and-See Modem Capacity Nr of Subscribers

24 Capacity Strategy What drives ‘expansionist’ vs. ‘wait-and- see’ strategies?

25 Queuing Management The firm’s view: Manage demand as well as capacity Balance cost of service with cost of waiting (“economic optimization” at LL Bean) Use customer waiting time –co-production –sales

26 Queuing Management The psychology of queuing: There’s more to a line than its wait (Larson) –perceived waiting time & the environment –justice –information and expectations

27 Management of Queues: Summary of Insights High utilization causes congestion, high WIP and long lead times Variability causes congestion, high WIP and long lead times Multiple performance measures are often necessary to gauge true performance. Cost must be balanced with service, and the entire customer experience must be managed