© Wallace J. Hopp, Mark L. Spearman, 1996, 2000 1 Variability Basics.

Slides:



Advertisements
Similar presentations
Introduction to Queuing Theory
Advertisements

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.
1 Chapter 8 Queueing models. 2 Delay and Queueing Main source of delay Transmission (e.g., n/R) Propagation (e.g., d/c) Retransmission (e.g., in ARQ)
OMG Operations Management Spring 1997
1 Variability Basics God does not play dice with the universe. ---Albert Einstein Stop telling God what to do. ---Niels Bohr.
OPSM 405 Service Management Class 19: Managing waiting time: Queuing Theory Koç University Zeynep Aksin
Variability Basics God does not play dice with the universe.
Queueing Model 박희경.
Previously Optimization Probability Review Inventory Models Markov Decision Processes.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
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),
1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.
Performance Evaluation
Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO
Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO
Little´s law Skorkovský ,KPH,ESF.MU
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues: Overview and Examples.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Introduction to Queuing Theory. 2 Queuing theory definitions  (Kleinrock) “We study the phenomena of standing, waiting, and serving, and we call this.
WINTER 2012IE 368. FACILITY DESIGN AND OPERATIONS MANAGEMENT 1 IE 368: FACILITY DESIGN AND OPERATIONS MANAGEMENT Lecture Notes #3 Production System Design.
1 Chapter 7 Dynamic Job Shops Advantages/Disadvantages Planning, Control and Scheduling Open Queuing Network Model.
Modeling and Analysis of CONWIP-based Flowlines as Closed Queueing Networks.
Introduction to Queuing Theory
OPSM 301: Operations Management
© Wallace J. Hopp, Mark L. Spearman, 1996, The Corrupting Influence of Variability When luck is on your side, you.
The Simulation Project. Simulation Project Steps a.- Problem Definition b.- Statement of Objectives c.- Model Formulation and Planning d.- Model Development.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
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
Queuing models Basic definitions, assumptions, and identities Operational laws Little’s law Queuing networks and Jackson’s theorem The importance of think.
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
© Wallace J. Hopp, Mark L. Spearman, 1996, The Corrupting Influence of Variability When luck is on your side, you.
TM 663 Operations Planning October 24, 2011 Paula Jensen
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.
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
1 Elements of Queuing Theory The queuing model –Core components; –Notation; –Parameters and performance measures –Characteristics; Markov Process –Discrete-time.
CS433 Modeling and Simulation Lecture 12 Queueing Theory Dr. Anis Koubâa 03 May 2008 Al-Imam Mohammad Ibn Saud University.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues.
Penny Fab WIP=1.
1 Basic Factory Dynamics 2 HAL Case Large Panel Line: produces unpopulated printed circuit boards Line runs 24 hr/day (but 19.5 hrs of productive time)
Queuing Models in Operations
Facilities design. Main Topics Discrete vs. Continuous Flow and Repetitive Manufacturing Process vs. Product-focused designs and the other currently used.
Computer Networking Queueing (A Summary from Appendix A) Dr Sandra I. Woolley.
Modeling and Analysis of CONWIP-based Flowlines as Closed Queueing Networks.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
The Effects of Process Variability 35E00100 Service Operations and Strategy #3 Fall 2015.
Chapter 6 Queueing Models
Queuing Theory.  Queuing Theory deals with systems of the following type:  Typically we are interested in how much queuing occurs or in the delays at.
Queueing Theory. The study of queues – why they form, how they can be evaluated, and how they can be optimized. Building blocks – arrival process and.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues.
Queuing Theory Simulation & Modeling.
Effects of Variability. Successive Units on Time Line t How variable is this system ? p. 5.
Lecture 14 – Queuing Networks
Managing Flow Variability: Safety Capacity
An introduction to Factory Physics
Modeling and Simulation (An Introduction)
Al-Imam Mohammad Ibn Saud University
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues: Overview and Examples.
IV-2 Manufacturing Systems modeling
Variability 8/24/04 Paul A. Jensen
Topics Modeling CONWIP Flowlines as Closed Queueing Networks
Lecture 14 – Queuing Networks
Basic Factory Dynamics
Presentation transcript:

© Wallace J. Hopp, Mark L. Spearman, 1996, Variability Basics

© Wallace J. Hopp, Mark L. Spearman, 1996, Variability Makes a Difference! Little’s Law: TH = WIP/CT, so same throughput can be obtained with large WIP, long CT or small WIP, short CT. The difference? Penny Fab One: achieves full TH (0.5 j/hr) at WIP=W 0 =4 jobs if it behaves like Best Case, but requires WIP=27 jobs to achieve 95% of capacity if it behaves like the Practical Worst Case. Why?

© Wallace J. Hopp, Mark L. Spearman, 1996, Tortise and Hare Example Two machines: subject to same workload: 69 jobs/day (2.875 jobs/hr) subject to unpredictable outages (availability = 75%) Hare X19: long, but infrequent outages Tortoise 2000: short, but more frequent outages Performance: Hare X19 is substantially worse on all measures than Tortoise Why?

© Wallace J. Hopp, Mark L. Spearman, 1996, Variability Views Variability: Any departure from uniformity Random versus controllable variation Randomness: Essential reality? Artifact of incomplete knowledge? Management implications: robustness is key

© Wallace J. Hopp, Mark L. Spearman, 1996, Probabilistic Intuition Uses of Intuition: driving a car throwing a ball mastering the stock market First Moment Effects: Throughput increases with machine speed Throughput increases with availability Inventory increases with lot size Our intuition is good for first moments g

© Wallace J. Hopp, Mark L. Spearman, 1996, Probabilistic Intuition (cont.) Second Moment Effects: Which is more variable – processing times of parts or batches? Which are more disruptive – long, infrequent failures or short frequent ones? Our intuition is less secure for second moments Misinterpretation – e.g., regression to the mean

© Wallace J. Hopp, Mark L. Spearman, 1996, Variability Definition: Variability is anything that causes the system to depart from regular, predictable behavior. Sources of Variability: setups workpace variation machine failures differential skill levels materials shortages engineering change orders yield loss customer orders rework product differentiation operator unavailability material handling

© Wallace J. Hopp, Mark L. Spearman, 1996, Measuring Process Variability Note: we often use the “squared coefficient of variation” (SCV), c e 2

© Wallace J. Hopp, Mark L. Spearman, 1996, Variability Classes in Factory Physics Effective Process Times: actual process times are generally LV effective process times include setups, failure outages, etc. HV, LV, and MV are all possible in effective process times Relation to Performance Cases: For balanced systems MV – Practical Worst Case LV – between Best Case and Practical Worst Case HV – between Practical Worst Case and Worst Case 0.75 High variability (HV) Moderate variability (MV) Low variability (LV) cece

© Wallace J. Hopp, Mark L. Spearman, 1996, Natural Variability Definition: variability without explicitly analyzed cause Sources: operator pace material fluctuations product type (if not explicitly considered) product quality Observation: natural process variability is usually in the LV category.

© Wallace J. Hopp, Mark L. Spearman, 1996, Down Time – Mean Effects Definitions:

© Wallace J. Hopp, Mark L. Spearman, 1996, Down Time – Mean Effects (cont.) Availability: Fraction of time machine is up Effective Processing Time and Rate:

© Wallace J. Hopp, Mark L. Spearman, 1996, Totoise and Hare - Availability Hare X19: t 0 = 15 min  0 = 3.35 min c 0 =  0 /t 0 = 3.35/15 = 0.05 m f = 12.4 hrs (744 min) m r = hrs (248 min) c r = 1.0 Availability: Tortoise: t 0 = 15 min  0 = 3.35 min c 0 =  0 /t 0 = 3.35/15 = 0.05 m f = 1.9 hrs (114 min) m r = hrs (38 min) c r = 1.0 A =

© Wallace J. Hopp, Mark L. Spearman, 1996, Down Time – Variability Effects Effective Variability: Conclusions: Failures inflate mean, variance, and CV of effective process time Mean (t e ) increases proportionally with 1/A SCV (c e 2 ) increases proportionally with m r SCV (c e 2 ) increases proportionally in c r 2 For constant availability (A), long infrequent outages increase SCV more than short frequent ones Variability depends on repair times in addition to availability

© Wallace J. Hopp, Mark L. Spearman, 1996, Tortoise and Hare - Variability Hare X19: t e = c e 2 = Tortoise 2000 t e = c e 2 =

© Wallace J. Hopp, Mark L. Spearman, 1996, Setups – Mean and Variability Effects Analysis:

© Wallace J. Hopp, Mark L. Spearman, 1996, Setups – Mean and Variability Effects (cont.) Observations: Setups increase mean and variance of processing times. Variability reduction is one benefit of flexible machines. However, the interaction is complex.

© Wallace J. Hopp, Mark L. Spearman, 1996, Setup – Example Data: Fast, inflexible machine – 2 hr setup every 10 jobs Slower, flexible machine – no setups Traditional Analysis?

© Wallace J. Hopp, Mark L. Spearman, 1996, Setup – Example (cont.) Factory Physics Approach: Compare mean and variance Fast, inflexible machine – 2 hr setup every 10 jobs

© Wallace J. Hopp, Mark L. Spearman, 1996, Setup – Example (cont.) Slower, flexible machine – no setups Conclusion:

© Wallace J. Hopp, Mark L. Spearman, 1996, Setup – Example (cont.) New Machine: Consider a third machine same as previous machine with setups, but with shorter, more frequent setups Analysis: Conclusion:

© Wallace J. Hopp, Mark L. Spearman, 1996, Other Process Variability Inflators Sources: operator unavailability recycle batching material unavailability et cetera, et cetera, et cetera Effects: inflate t e inflate c e Consequences:

© Wallace J. Hopp, Mark L. Spearman, 1996, Illustrating Flow Variability t Low variability arrivals t High variability arrivals

© Wallace J. Hopp, Mark L. Spearman, 1996, Measuring Flow Variability

© Wallace J. Hopp, Mark L. Spearman, 1996, Propagation of Variability Single Machine Station: where u is the station utilization given by u = r a t e Multi-Machine Station: where m is the number of (identical) machines and c d 2 (i) = c a 2 (i+1) ii+1 departure var depends on arrival var and process var ce2(i)ce2(i) ca2(i)ca2(i)

© Wallace J. Hopp, Mark L. Spearman, 1996, Propagation of Variability – High Utilization Station HV LV HV LV HV Conclusion: flow variability out of a high utilization station is determined primarily by process variability at that station.

© Wallace J. Hopp, Mark L. Spearman, 1996, Propagation of Variability – Low Utilization Station HV LV Conclusion: flow variability out of a low utilization station is determined primarily by flow variability into that station. HV LV HV

© Wallace J. Hopp, Mark L. Spearman, 1996, Variability Interactions Importance of Queueing: manufacturing plants are queueing networks queueing and waiting time comprise majority of cycle time System Characteristics: Arrival process Service process Number of servers Maximum queue size (blocking) Service discipline (FCFS, LCFS, EDD, SPT, etc.) Balking Routing Many more

© Wallace J. Hopp, Mark L. Spearman, 1996, Kendall's Classification A/B/C A: arrival process B: service process C: number of machines M: exponential (Markovian) distribution G: completely general distribution D: constant (deterministic) distribution. A B C Queue Server

© Wallace J. Hopp, Mark L. Spearman, 1996, Queueing Parameters r a = the rate of arrivals in customers (jobs) per unit time (t a = 1/r a = the average time between arrivals). c a = the CV of inter-arrival times. m = the number of machines. r e = the rate of the station in jobs per unit time = m/t e. c e = the CV of effective process times. u = utilization of station = r a /r e. Note: a station can be described with 5 parameters.

© Wallace J. Hopp, Mark L. Spearman, 1996, Queueing Measures Measures: CT q = the expected waiting time spent in queue. CT = the expected time spent at the process center, i.e., queue time plus process time. WIP = the average WIP level (in jobs) at the station. WIP q = the expected WIP (in jobs) in queue. Relationships: CT = CT q + t e WIP = r a  CT WIP q = r a  CT q Result: If we know CT q, we can compute WIP, WIP q, CT.

© Wallace J. Hopp, Mark L. Spearman, 1996, The G/G/1 Queue Formula: Observations: Useful model of single machine workstations Separate terms for variability, utilization, process time. CT q (and other measures) increase with c a 2 and c e 2 Flow variability, process variability, or both can combine to inflate queue time. Variability causes congestion!

© Wallace J. Hopp, Mark L. Spearman, 1996, The G/G/m Queue Formula: Observations: Useful model of multi-machine workstations Extremely general. Fast and accurate. Easily implemented in a spreadsheet (or packages like MPX).

© Wallace J. Hopp, Mark L. Spearman, 1996, basic data failures setups yield measures VUT Spreadsheet

© Wallace J. Hopp, Mark L. Spearman, 1996, Effects of Blocking VUT Equation: characterizes stations with infinite space for queueing useful for seeing what will happen to WIP, CT without restrictions But real world systems often constrain WIP: physical constraints (e.g., space or spoilage) logical constraints (e.g., kanbans) Blocking Models: estimate WIP and TH for given set of rates, buffer sizes much more complex than non-blocking (open) models, often require simulation to evaluate realistic systems

© Wallace J. Hopp, Mark L. Spearman, 1996, The M/M/1/b Queue B buffer spaces Infinite raw materials Model of Station Note: there is room for b=B+2 jobs in system, B in the buffer and one at each station. Goes to u/(1-u) as b  Always less than WIP(M/M/1) Goes to r a as b  Always less than TH(M/M/1) Little’s law Note: u>1 is possible; formulas valid for u  1

© Wallace J. Hopp, Mark L. Spearman, 1996, Blocking Example B=2 t e (1)=21t e (2)=20 M/M/1/b system has less WIP and less TH than M/M/1 system 18% less TH 90% less WIP

© Wallace J. Hopp, Mark L. Spearman, 1996, Seeking Out Variability General Strategies: look for long queues (Little's law) look for blocking focus on high utilization resources consider both flow and process variability ask “why” five times Specific Targets: equipment failures setups rework operator pacing anything that prevents regular arrivals and process times

© Wallace J. Hopp, Mark L. Spearman, 1996, Variability Pooling Basic Idea: the CV of a sum of independent random variables decreases with the number of random variables. Example (Time to process a batch of parts):

© Wallace J. Hopp, Mark L. Spearman, 1996, Basic Variability Takeaways Variability Measures: CV of effective process times CV of interarrival times Components of Process Variability failures setups many others - deflate capacity and inflate variability long infrequent disruptions worse than short frequent ones Consequences of Variability: variability causes congestion (i.e., WIP/CT inflation) variability propagates variability and utilization interact pooled variability less destructive than individual variability