Flow, Inventory, Throughput, and Little’s Law

Slides:



Advertisements
Similar presentations
THEORY OF CONSTRAINTS & DRUM – BUFFER - ROPE
Advertisements

Process Flow Analysis The Little’s Law The main source for preparing these slides is Managing Business Process Flow Anupindi, Chopra, Deshmoukh, Van.
Exponential Distribution
1 Slide Process Analysis Fundamentals MGT Slide Process Definition  A process is a collection of operations connected by a flow of transactions.
Queueing Models and Ergodicity. 2 Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing models.
INDR 343 Problem Session
Scheduling. Production Planning Process Process Planning Strategic Capacity Planning Aggregate Planning Master Production Scheduling Material Requirements.
Review of Probability Distributions
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
OPSM 301 Operations Management
1 Waiting Lines Also Known as Queuing Theory. 2 Have you ever been to the grocery store and had to wait in line? Or maybe you had to wait at the bank.
Queuing Models Basic Concepts
Lecture 4 MGMT © 2011 Houman Younessi Supply: Production What is the optimal level of output? How should we decide among alternative production.
IV. Little’s Law and Labor Costs
1 Process Mapping BA 339 Mellie Pullman. 2 Objectives Service Process Differences Little’s Law Process Analysis & Mapping.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E
from Prof. Goldsman’s lecture notes
Copyright © 2014 Pearson Education, Inc. publishing as Prentice Hall
CHAPTER 17 Process Costing.
Little´s law Skorkovský ,KPH,ESF.MU
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.
Lab 01 Fundamentals SE 405 Discrete Event Simulation
1 ISQA 459/559 Mellie Pullman Scheduling Shop Floor.
Lecture 14 – Queuing Systems
Operations Scheduling. Scheduling in a Process-Focused Environment.
Operations Management Contemporary Concepts and Cases Chapter Thirteen Scheduling Operations Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights.
Chapter Two Manufacturing Costs and Job-Order Costing Systems.
Announcement-exam rules
Process Costing Dr. Hisham Madi. Process Costing  Process-costing systems are used when companies produce a large quantity of identical or very similar.
Introduction to Operations Research
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Ch 6 Tech Notes OBJECTIVES
OPSM 301 Operations Management Class 2: Business process flows: Measurement Koç University Zeynep Aksin
Dimitar Bakardzhiev Managing Partner Taller Technologies Project Planning using Little’s Law.
IE 429, Parisay, January 2010 What you need to know from Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete,
IES 342 Industrial Cost Analysis & Control | Dr. Karndee Prichanont, SIIT 1 Process Costing Chapter 11 Objectives: Explain the basic ideas underlying process.
Drum –Buffer-Rope Based on : R. Holt, Ph.D., PE
OMSAN LOJİSTİK. Production and Operations Management 2: Process Flow Fundamentals Top Management Program in Logistics & Supply Chain Management (TMPLSM)
IE450 Models Relating Cycle-time, Throughput, WIP and Batch Sizes
MINGZHE HAN (CMP TUTOR) COMM 204 Review Session. Outline T ABLE OF C ONTENT (Basic Information) (Process Analysis) (Multiple Types and the Product Process.
4-1 Chapter Four Systems Design: Process Costing.
Scheduling. Scheduling: The allocation of resources over time to accomplish specific tasks. Demand scheduling: A type of scheduling whereby customers.
OMSAN LOJİSTİK. Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis.
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.
Solved Problem An inspection station for assembling printers receives 40 printers/hour and has two inspectors, each of whom can inspect 30 printers per.
Operations Fall 2015 Bruce Duggan Providence University College.
This tutorial will talk you through a very basic workbench queueing simulation. The queueing system modelled is of customers entering an infinite capacity.
(C) J. M. Garrido1 Objects in a Simulation Model There are several objects in a simulation model The activate objects are instances of the classes that.
 Recall your experience when you take an elevator.  Think about usually how long it takes for the elevator to arrive.  Most likely, the experience.
Simulation modelling real processes to make predictions.
Copyright © 2009 Pearson Education, Inc. 2.4 Index Numbers LEARNING GOAL Understand the concept of an index number; in particular, understand how the Consumer.
16 Scheduling (focus on sequencing; FCFS, SPT, EDD pages , and Johnson’s rule pages ) Homework; 6, 7, 11.
Managerial Decision Making Chapter 13 Queuing Models.
Supply Chain Customer Order Decoupling Point
Key Learnings: Little’s Law
Example: A Hospital Emergency Room
The Islamic University –Gaza
Modeling and Simulation (An Introduction)
assemble-to-order (ATO) A system that produces standard modules to be
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
Introduction Notation Little’s Law aka Little’s Result
Solutions Queueing Theory 1
Chapter 5 Process Analysis.
Modeling Scheduling Problems
Lecture 13 – Queuing Systems
Lecture 2 Part 3 CPU Scheduling
Process Analysis “If you cannot describe what you are doing as a process, you do not know what you are doing.” W.E. Deming.
Sequencing Sequencing: Determine the order in which jobs at a work center will be processed. Workstation: An area where one person works, usually with.
Chapter 5 Process Analysis.
Presentation transcript:

Flow, Inventory, Throughput, and Little’s Law Models in IE: Lecture 6 Flow, Inventory, Throughput, and Little’s Law

Today’s Core Concepts Flow, Flow Unit Flowtime Throughput WIP, Inventory Little’s Law Bottleneck

Georgia Tech as a flow process 1 student = 1 flow unit

IE 2030 Lecture 6 Flow unit Throughput: rate of flow units through a point per unit time Input rate, output rate, and steady state Flow time: on average, amount of time a flow unit spends within the system WIP, inventory: number of units in system (within system boundaries).

IE 2030 Flow Unit Examples Kitchen in restaurant: flow unit=1food order Gas station pump: flow unit = 1 gallon of gasoline Gas station: flow unit = 1 customer (1 car) Clothes store: flow unit = 1 article of clothing

IE 2030 Lecture 6: Inventory Inventory: number of flow units within system boundaries At Tech: number of students who have matriculated but not graduated (ignoring dropouts) Number of cars waiting for or getting gas Number of food orders waiting or cooking OR, # of food orders brought to kitchen, not cooked and taken by waiters (different system boundary)

Flow unit, inventory Input: many different materials and parts Output: many different electronics components What is a flow unit? Filled order One component materials to make a component?? $ of materials

IE 2030 Lecture 6: Flowtime Flowtime for a particular item in a system = time it leaves system - time it enters system Flowtime usually means: on average, the amount of time a flow unit spends in system How long does a dollar remain in your checking account?

Throughput: rate of flow units through a point Kitchen in restaurant: # food orders arriving OR started cooking OR finished cooking... Gas pump:# gallons pumped out/hour Gas station: # customers served/hour # clothes sold/week

IE 2030: Little’s Law Little’s Law is for a system in steady state input rate = output rate Similar to rate × time = distance Applies to most systems, even those with variability Uses AVERAGE values throughput rate × flowtime = inventory

Georgia Tech Little’s Law at Georgia Tech 12,500 Students 2500/year How long does it take to graduate?

Simple example: all students take 5 years 1 2 3 4 5 6 7 8 Simple example: all students take 5 years

Better example: some take 4, some take 6 years 1 2 3 4 5 6 7 8 Better example: some take 4, some take 6 years

IE 2030 Lecture 6 Little’s Law Measurement In the first example, if you ask students how long they will be at Tech, they say… In the second example, some say 4, some say 6, but on average they say…. 5 years 5.2 years

Little’s Law,Measurement, and Sampling Visit a prison and ask inmates the lengths of their sentences until probation Find the time served of inmates who died or were released on probation Do you believe statistics reported in the news by honest, well-meaning reporters? In general, should sample flow units passing a point in the system. More work!

Steady State vs. Startup Flow time defined for stable system Input rate = Output rate Inventory doesn’t   Startup or transient behavior can be important, especially if change is frequent Does the economy ever reach equilibrium?

Little’s Law works even if System has Variability

P[4 years]=.4 P[5 years]=.2 P[6 years]=.4 1 2 3 4 5 6 7 8 P[4 years]=.4 P[5 years]=.2 P[6 years]=.4

Random number of students arriving/year 1 2 3 4 5 6 7 8 Random number of students arriving/year

Little’s Law still works Variability Little’s Law still works Randomness in arrival rate Randomness in arrival type Randomness in service or production rates System must be stable Dependence can be a problem

Bottlenecks Definition: reduce rate, reduce throughput Why not defined in terms of increase? Semester conversion at Tech --- Chem labs a bottleneck Flowlines usually have bottlenecks. Line balancing. Jobshops are more complex; idea of bottleneck less easily applicable. Bottlenecks are often unclear when there is variability

Example: Insight from Little’s Law (L. McGinnis) We put orders into the production system 1 month before their deadlines, but they are taking 1 month to be produced on average. More than half are late (why need it not be exactly half?) Response: we put orders in 2 months before deadline. What happens?

Example: Insight from Little’s Law (L. McGinnis) We think we’ve changed rate, but output rate and future input rate are the same. We’ve doubled inventory  doubled flowtime Now orders take 2 months to produce, on average In fact, orders now take more than 2 months on average! (Why?)

Some Objectives for a System Throughput (max.) Cost per unit, including inventory (min) flowtime (min) total flowtime for a set of jobs (min) makespan for a set of jobs (min) example: 6 jobs time 2; 4 time 3; 3 time 4, 2 time 6. On 4 machines, minimizing makespan is not the same as minimizing total flowtime