OMSAN LOJİSTİK. Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis.

Slides:



Advertisements
Similar presentations
Waiting Line Management
Advertisements

Lecture 10 Queueing Theory. There are a few basic elements common to almost all queueing theory application. Customers arrive, they wait for service in.
Exponential Distribution
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines1  Understanding the phenomenon of waiting  Measures.
Queuing Models Basic Concepts
Probability Distributions
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
HW # Due Day: Nov 23.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
#11 QUEUEING THEORY Systems Fall 2000 Instructor: Peter M. Hahn
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
Queues / Lines You manage a call center which can answer an average of 20 calls an hour. Your call center gets 17.5 calls in an average hour. On average.
Queuing and Transportation
Example 14.4 Queuing | 14.2 | 14.3 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n Which system has the.
Polling: Lower Waiting Time, Longer Processing Time (Perhaps)
Waiting Lines.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
HW # Due Day: Nov 23.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
Lecture 14 – Queuing Systems
WINTER 2012IE 368. FACILITY DESIGN AND OPERATIONS MANAGEMENT 1 IE 368: FACILITY DESIGN AND OPERATIONS MANAGEMENT Lecture Notes #3 Production System Design.
OPSM 301: Operations Management
A Somewhat Odd Service Process (Chapters 1-6)
MBA 8452 Systems and Operations Management MBA 8452 Systems and Operations Management Product Design & Process Selection —Service.
Copyright warning. COMP5348 Lecture 6: Predicting Performance Adapted with permission from presentations by Alan Fekete.
Variability – Waiting Times
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
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.
OMSAN LOJİSTİK Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 5: Capacity.
OMG Operations Management Spring 1997 CLASS 6: Process Design and Performance Measurement Harry Groenevelt.
Lines and Waiting Waiting and Service Quality A Quick Look at Queuing Theory Utilization versus Variability Tradeoff Managing Perceptions... “Every day.
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)
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
IE 429, Parisay, January 2010 What you need to know from Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete,
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Queuing Modeling and Analysis.
Chapter 16 Capacity Planning and Queuing Models
OMG Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt.
OMSAN LOJİSTİK. Production and Operations Management 2: Process Flow Fundamentals Top Management Program in Logistics & Supply Chain Management (TMPLSM)
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
IE450 Models Relating Cycle-time, Throughput, WIP and Batch Sizes
Queuing Models in Operations
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.
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.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
Waiting Line Theory Akhid Yulianto, SE, MSc (log).
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.
Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.
 Recall your experience when you take an elevator.  Think about usually how long it takes for the elevator to arrive.  Most likely, the experience.
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Asian School of Business PG Programme in Management ( ) Course: Quantitative Methods in Management I Instructor: Chandan Mukherjee Session 8: Useful.
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
1 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.
Managerial Decision Making Chapter 13 Queuing Models.
Lecture 14 – Queuing Networks
18 Management of Waiting Lines
Managing Flow Variability: Safety Capacity
Demo on Queuing Concepts
Management of Waiting Lines
Variability 8/24/04 Paul A. Jensen
Queuing Models and Capacity Planning
Lecture 13 – Queuing Systems
Lecture 14 – Queuing Networks
Model Antrian M/M/s.
Waiting Line Models Waiting takes place in virtually every productive process or service. Since the time spent by people and things waiting in line is.
Presentation transcript:

OMSAN LOJİSTİK

Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis

3 Process Flow Analysis Objectives: Increase Throughput Rate Reduce Throughput Time (and Inventories) Reduce Waste (and, more generally, operating costs) Objectives: Increase Throughput Rate Reduce Throughput Time (and Inventories) Reduce Waste (and, more generally, operating costs)

4 Throughput Rate is determined by the Bottleneck(s) AB CD E

5 AB CD E But don’t be surprised if throughput rate is less than the “capacity” of the bottleneck! There is a difference between “rated capacity” & “utilizable capacity” There is a difference between “rated capacity” & “utilizable capacity”

6 “Rated Capacity” “Utilizable Capacity” In Manufacturing due to Breakdowns and repairs Operators skill and experience Product & material variations Availability (arrival) of inputs Changes in schedule (setups) Rate of Rejects and Off-Specs Etc. Why the Difference? The Curse of Variability Similar reasons apply also in service operations

7 Focus on narrowing this difference especially in bottleneck operations But be aware of “side effects” of pushing for very high levels of capacity utilization, especially on throughput time and waste

8 Capacity Utilization Inventory or Queue 100% 80%60%20%40% Throughput time rises rapidly at higher levels of capacity utilization Consider a powerful insight from Queuing Models

9 Scheduling bottleneck operations very close to their rated capacity can create high WIP and long lead times AB CD E Capacity Utilization Inventory (or lead time,or waiting time)

10 More Variability More variability means less “utilizable capacity” for same level of inventory (or waiting time) Capacity Utilization Inventory (or waiting time)

11 The Triangle of Basic Choices Capacity Utilization Low Variability “Extra” Capacity Inventory (or lead time) High Inventory (or long lead time)

12

13 What if Arrivals & Service Times are not uniform? Arrivals at Average Rate (jobs/hr) Service at Average Rate  (jobs/hr)

14 How do we measure variability? We know standard deviation (“s”) is a measure of variability x Pr (x) A (larger s) B (smaller s) A is clearly more variable than B

15 Pr (x) Number of customers per hour (“x”) m=50m=120 But which of these demand patterns is more variable? A s=10 B s= We need something better than “s” alone

16 Arrivals and service times in many situations follow an exponential distribution 0 0 Time Exponential distribution: Probability density, f(t) = exp (- t) Mean Which makes life easy because s=m in exponential distribution i.e., c=1

17 Variability in Arrivals, c a  When there is no variability ( s = 0) c a = s / m = 0 u When arrivals are “Random” c a = s / m = 1 Time between arrivals is exponentially distributed (which is the same as saying number arrivals in a given time interval is Poisson distributed) u And c a can be any other number

18 Same story for variability of service, c s u When there is no variability in processing time ( s = 0) c s = s / m = 0 u When processing times are “Random” c s = s / m = 1 (I.e., processing times are exponentially distributed) u And c s can be any other number (reflecting other distributions)

19 How do find waiting time when there is variability? Service time: 1/  (hrs/job) Time in Queue W q (hrs/job) W = Wq + 1/ 

QueueServer (resource) Arrivals Arrival rate = Mean interarrival time = m a = 1 / Standard deviation in interarrival time = s a Coefficient of variation in interarrival time = c a = s a / m a Average waiting time in queue = W q Average number in queue = L q Services Processing rate =  Mean service (processing) time = m s = 1 /  Standard deviation in processing time = s s Coefficient of variation in processing time = c s = s s / m s Utilization =  = /  Average number in service =  Average total waiting time in the system (in the queue and in service) = W = W q + 1 /  Average total number in the system (in the queue and in service ) = L = L q +  Equations!

21 Exercise … trying the Equations! Consider a store where customers arrive randomly at an average rate of 10 per hour. Service times have a mean of 5 minutes and a standard deviation of 2 minutes. Calculate: –What is the avg total time a customer spends in the system? –What fraction of time is the resource occupied? –What is the avg number of customers in the system? –What is the avg number of customers in the queue? –What would your answers be if all services took exactly 5 minutes?

22 PK Formula W q = (1 /  ) [  / (1 –  Process Time Capacity Utilization Variability )] [(c a 2 + c s 2 ) / 2]

23 The bartender Example Assume a bartender can serve on average 10 drinks per hour (but some drinks take more than 6 minutes and some less; Assume processing times are “random”, Cs=1) Assume Customers arrive “randomly” ( i.e., Ca=1) Let’s see what happens when different number of customers arrive per hour

24 Arrival Rate Customers/hr Capacity. Utilization   /(1 -  ) Waiting Time W q Hours q  W = (1 /) [ / (1 –  )] [(c a 2 + c s 2 ) / 2] Let’s apply the PK Formula

25 Waiting time Capacity utilization Waiting time, hours

26 Remember the triangle Capacity Utilization Low Variability “Extra” Capacity Inventory (or lead time) High Inventory (or long lead time)

27 Basic Principle uAs the variability in an operating system becomes more severe, it becomes increasingly difficult to simultaneously achieve high utilization and low inventory. arrival processservice process uGenerally speaking, all else equal, the more variable the arrival process and the service process, the more likely jobs are going to clump up, average service will be longer, and therefore the more waiting time there will be on average Excess Capacity uImmediate consequence: Excess Capacity will be required in systems containing variability.