Manufacturing System Flow Analysis

Similar documents
S. T. Enns Paul Rogers. Dept. of Mechanical and Manufacturing Engineering University of Calgary Calgary, AB., T2N-1N4, CANADA

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP

A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS

Single-part-type, multiple stage systems

ORI 390Q Models and Analysis of Manufacturing Systems First Exam, fall 1994

Push and Pull Systems in a Dynamic Environment

A Semiconductor Wafer

Design of Manufacturing Systems Manufacturing Cells

Duration of online examination will be of 1 Hour 20 minutes (80 minutes).

Systems Optimization and Analysis Optimization Project. Labor Planning for a Manufacturing Line

SYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: production and operations management

Analysis of Software Artifacts

Design of Cellular Manufacturing Systems for Dynamic and Uncertain Production Requirements with Presence of Routing Flexibility

Chaotic Behavior in a Deterministic Model of Manufacturing

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

ISyE 2030 Practice Test 1

Control of Fork-Join Networks in Heavy-Traffic

Basic Queueing Theory

MACHINE DEDICATION UNDER PRODUCT AND PROCESS DIVERSITY. Darius Rohan. IBM Microelectonics Division East Fishkill, NY 12533, U.S.A.

ISyE 2030 Practice Test 2

Cost models for lot streaming in a multistage flow shop

COMP9334: Capacity Planning of Computer Systems and Networks

Queueing Theory. VK Room: M Last updated: October 17, 2013.

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

MIT Manufacturing Systems Analysis Lectures 6 9: Flow Lines

Bucket brigades - an example of self-organized production. April 20, 2016

Available online at ScienceDirect. Procedia CIRP 17 (2014 )

On the equivalence of economic lot scheduling and switched production systems

Zero-Inventory Conditions For a Two-Part-Type Make-to-Stock Production System

QUEUING SYSTEM. Yetunde Folajimi, PhD

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling

Multi Heterogeneous Queueing Server System. General Exam Oral Examination Fall 2012 prepared by Husnu Saner Narman

Type 1. Type 1 Type 2 Type 2 M 4 M 1 B 41 B 71 B 31 B 51 B 32 B 11 B 12 B 22 B 61 M 3 M 2 B 21

A Method for Sweet Point Operation of Re-entrant Lines

On the Partitioning of Servers in Queueing Systems during Rush Hour

Waiting Line Models: Queuing Theory Basics. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1

Synchronized Queues with Deterministic Arrivals

Introduction to Queuing Theory. Mathematical Modelling

Queuing Theory. Using the Math. Management Science

Departure time choice equilibrium problem with partial implementation of congestion pricing

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Stochastic Models of Manufacturing Systems

Continuous Dynamic Models, Clearing Functions, and Discrete-Event Simulation in Aggregate Production Planning

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

4.7 Finite Population Source Model

Dynamic Control of Parallel-Server Systems

Improved Algorithms for Machine Allocation in Manufacturing Systems

CDA5530: Performance Models of Computers and Networks. Chapter 4: Elementary Queuing Theory

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Linear Model Predictive Control for Queueing Networks in Manufacturing and Road Traffic

SINGLE-SERVER AGGREGATION OF A RE-ENTRANT FLOW LINE

Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment

0utline. 1. Tools from Operations Research. 2. Applications

Analytical Approximations to Predict Performance Measures of Manufacturing Systems with Job Failures and Parallel Processing

Pooling in tandem queueing networks with non-collaborative servers

Stochastic Models of Manufacturing Systems

YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)

A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers

Slides 9: Queuing Models

Effective Bandwidth for Traffic Engineering

X i. X(n) = 1 n. (X i X(n)) 2. S(n) n

Reducing manufacturing lead times and minimizing work-in-process (WIP) inventories

Stochastic Models of Manufacturing Systems

Development and Application of a New Modeling Technique for Production Control Schemes in Manufacturing Systems

Data analysis and stochastic modeling

OPTIMAL CONTROL OF PARALLEL QUEUES WITH BATCH SERVICE

Lot Streaming in Two-Stage Flow Shops and Assembly Systems

Advanced Computer Networks Lecture 3. Models of Queuing

Bryco Machine Welcomes SME and AME. October 1, 2008

Modeling and Analysis of Manufacturing Systems

System with a Server Subject to Breakdowns

Queueing models for a single machine subject to multiple types of interruptions

Determining Production Capacity under the consideration of a multistage

Advanced Olefin Polymer Reactor Fundamentals and Troubleshooting

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS

Discrete Event Simulation. Motive

Sub-Optimal Scheduling of a Flexible Batch Manufacturing System using an Integer Programming Solution

Estimating process batch flow times in a two-stage stochastic flowshop with overlapping operations

A Retrial Queueing model with FDL at OBS core node

Production Planning and Control

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.)

Research Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times

Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe

Scheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling

Introduction to queuing theory

M. Gronalt and R. F. Hartl, Worker and floater time allocation Introduction and problem description In this paper we propose a simultaneous app

2 Verification of the design prerequisites (Design intent)

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Program Name: PGDBA Production and Operations Management Assessment Name: POM - Exam Weightage: 70 Total Marks: 70

Mechanical Engineering 101

Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow Shop Model

Single-part-type, multiple stage systems. Lecturer: Stanley B. Gershwin

Elementary queueing system

Coordinated Replenishments at a Single Stocking Point

Review Paper Machine Repair Problem with Spares and N-Policy Vacation

Stochastic Modeling and Analysis of Generalized Kanban Controlled Unsaturated finite capacitated Multi-Stage Production System

MIT Manufacturing Systems Analysis Lectures 19 21

CSM: Operational Analysis

Real-Time Calculus. LS 12, TU Dortmund

Transcription:

Manufacturing System Flow Analysis Ronald G. Askin Systems & Industrial Engineering The University of Arizona Tucson, AZ 85721 ron@sie.arizona.edu October 12, 2005

How Many IEs Does It Take to Change a Light Bulb?

n? One to Work Sample to Detect Burned out Bulbs One to Flowchart the Process One to Schedule the Maintenance One to Supervise the Maintenance Task One to Implement a Process Improvement Plan/Kaizen Event One to Determine Optimal Lumens for Replacement Bulb One to do an Economic Analysis of Buying Longer Life Bulbs

Overview of Session The Modern (Lean) Factory WIP vs. Flowtime & Throughput (Little s Law) Transfer Batches vs. Process Batches (Lot-streaming) Cross-Training (Balancing and Buckets) Performance Evaluation Open & Closed Cells

1. Factory Flow Thru Cell System Gears Chassis Assembly Shafts Cards Frame

Flow in a Cell J. T. Black, Design of the Factory with a Future, 1991

Cell Independence (Burbidge) Dedicated Team of (Compatible) Workers Dedicated Set of Machines Specified Set of Parts/Products Dedicated Space for Operations Common Goal and Evaluation Independence of Success Ideally 7-10 Members

2. Little s Law: Defining Rule for Flow L = λw (N = XT) WIP = Prod. Rate x Flow Time

Theoretical Profile! Capacity Production Deterministic N = X T Probabilistic (Exponential) WIP

Empirical Profile Little's Law and Chaos 12 10 8 Remember N = XT Throughput 6 4 Deterministic Exponential Empirical 2 0 0 10 20 30 40 50 60 70 80 90 WIP 10 stages, µ = 1

Questions? What happens when we release jobs to a busy shop floor? What happens when we reduce variability?

Typical Scenario: High Utilization, So Jobs are Late, Therefore Release More Jobs Early L=λW (or N=XT) 1. λ high implies λ small; 2. Since L increases, W increases; 3. As W (lead time) increases, tempted to release jobs even earlier 4. Congestion and interference reduce throughput

Reducing Variability General Arrivals (λ) and Service (S) E( ThroughputTime) = E( W ) + E( S) E( W ) q ρ ( 1+ C ) ( ) s Ca + ρ Cs 2 2 2 2 2 1 + ρ C ρ 2 2 s = λ q [ 2 λ(1 ρ) ] E( S) (ρ = X Capacity)

Question: How Far Is the Blue (Random) Line from the Purple (Deterministic) Line? ρ = 0.8, Exponential Arrivals vs. Fixed Interarrivals Random Service vs. Standardized Service What happens if we release jobs at fixed intervals? What happens with reliable processes & standard tasks?

3. Transfer vs. Process Batches Lot-Streaming Dividing the process batch into multiple transfer batches for concurrent processing at successive stages

Simple Illustration Machine 1 Three stages Batch size = 20 2 3 20 80 120 Time Unit proc. times = 1, 3, 2 a. One Transfer Batch No setup Machine 1 2 3 10 40 70 90 Time b. Two Transfer Batches Machine 1 2 3... 0 1 4 20 61 63 Time c. Single Unit Transfer Batches

MH vs Thruput Time Tradeoff MH Loads vs. Cycle Time 25 20 15 MH Loads 10 5 0 0 20 40 60 80 100 120 140 Cycle Time

Basic Rules (L Sublots, Q units) 1. Consistent, equal sublots good (not optimal) (p 2 q i = p 1 q i+1 is optimal for adjacent WSs) 2. Decreasing marginal benefit: 2 sublots50% of max gain Q T Q p p = + b L i b 3. Protect bottleneck (avoid sublot setup loss) i

4. Cross-Training Ensure Redundancy Consider Job Enrichment as Motivator Task Frequency Sufficient for Proficiency Lead Experts for Each Task Cover all Responsibilities Pay per Skill Breadth and Depth Worker Flexibility vs. WIP Safety Stock

a. Dynamic Rebalancing 1 4 min 3 min 6 min 8 min 3 min a. Two Workers Total Time = 24 1 4 min 3 min 6 min 8 min 3 min b. Three Workers Part Flow Worker Flow (Orbit) Workstation

b. Bucket Brigades (TSS) & Variants BB Assumes Task Continuity Ordered Workers Slowest to Fastest Effective in Picking Buffers can be added Champion Strategy (For low machine ρ) Leapfrog Strategy (Less worker movement)

5. Performance Evaluation N = X T Find X & T given N & Capacity Find T and needed N for desired X given Capacity Find T, X Tradeoff

Open System (Receive and Release) Random

Basic Poisson Process Estimate 1. Compute Effective Arrival Rates at Workstations m ' ' j = j + k pkj k = 1 λ λ λ 2. Evaluate Each Workstation (M/M/1) P(0) = 1-ρ 5/day (A) 5 4 4 2 6 L = ρ/(1-ρ) W = L/λ 6/day (B) 5

System & Product Measures 3. Aggregate Across Workstations m = j j= 1 W v W j W B = W +.67W + W

External Demand Closed System (CONWIP)

Basic Performance Evaluation - Closed Consider a Closed System with N Jobs: X = Production rate, T = Throughput time C P M =c j Total Servers or Max Active Jobs j= 1 M =t j Total Job Processing time j= 1 min( C, N) T P so N = XT X P

Performance Evaluation Extension Assume WIP Evenly Spread Out T N 1 1 + P, Exponential Processing Time M = N P, Constant, Synchronous Processing with N M M As Always, N=XT Very Optimistic Model! No Starvation when N M

References and Extensions 1. Askin, R. & J. Goldberg, Design and Analysis of Lean Production Systems, Wiley& Sons, 2002 2. Askin, R. & C. Standridge, Modeling and Analysis of Manufacturing Systems, Wiley & Sons, 1993 3. Black, J. T., Design of the Factory with a Future, McGraw Hill, 1991 4. Harmon, R & L. Peterson, Reinventing the Factory, Free Press, 1989 5. Hopp, W. and M. Spearman, Factory Physics, McGraw Hill, 2000.