Manufacturing System Flow Analysis

Transcription

1 Manufacturing System Flow Analysis Ronald G. Askin Systems & Industrial Engineering The University of Arizona Tucson, AZ October 12, 2005

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

3 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

4 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

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

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

7 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

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

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

10 Empirical Profile Little's Law and Chaos Remember N = XT Throughput 6 4 Deterministic Exponential Empirical WIP 10 stages, µ = 1

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

12 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

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

14 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?

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

16 Simple Illustration Machine 1 Three stages Batch size = Time Unit proc. times = 1, 3, 2 a. One Transfer Batch No setup Machine Time b. Two Transfer Batches Machine Time c. Single Unit Transfer Batches

17 MH vs Thruput Time Tradeoff MH Loads vs. Cycle Time MH Loads Cycle Time

18 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

19 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

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

21 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)

22

23 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

24 Open System (Receive and Release) Random

25 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) L = ρ/(1-ρ) W = L/λ 6/day (B) 5

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

27 External Demand Closed System (CONWIP)

28 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

29 Performance Evaluation Extension Assume WIP Evenly Spread Out T N 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

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