Two-Stage Paced Lines Active Learning – Module 2 Dr. Cesar Malave Texas A & M University.

Slides:



Advertisements
Similar presentations
EMBA-2, BUP Major Asad EO Chapter 5: Process Analysis.
Advertisements

Statistical Inventory control models I
SMA 6304/MIT2.853/MIT2.854 Manufacturing Systems Lecture 19-20: Single-part-type, multiple stage systems Lecturer: Stanley B. Gershwin
Cost Management Chapter 10 Static and Flexible Budgets
Process Design and Analysis
PROCESS DESIGN AND ANALYSIS Chapter Eleven Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
11–1. 11–2 Chapter Eleven Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Sensitivity Analysis In deterministic analysis, single fixed values (typically, mean values) of representative samples or strength parameters or slope.
PRODUCTION SYSTEMS ENGINEERING Chapter 11: Analysis of Exponential Lines Instructors: J. Li (Univ. of Kentucky) and S. M. Meerkov (Univ. of Michigan) Teaching.
Introduction to Transfer Lines Active Learning – Module 1
INDR 343 Problem Session
Statistical Inventory control models II
Engineering Economic Analysis Canadian Edition
Chapter 3 Steady-State Conduction Multiple Dimensions
Modeling and Analysis of Manufacturing Systems: Flow Lines Kimberly Murdoch MEAE MAMS Prof. E. Gutierrez-Miravete April 19, 2001.
An overview of design and operational issues of kanban systems M. S. AKTÜRK and F. ERHUN Presented by: Y. Levent KOÇAĞA.
Automated Production Lines
Reliability Chapter 4S.
Lecture 14 – Queuing Systems
Irwin/McGraw-Hill 1 Process Analysis Terms Process: Is any part of an organization that takes inputs and transforms them into outputs. Cycle Time: Is the.
Inventory control models EOQ Model. Learning objective After this class the students should be able to: calculate the order quantity that minimize the.
WINTER 2012IE 368. FACILITY DESIGN AND OPERATIONS MANAGEMENT 1 IE 368: FACILITY DESIGN AND OPERATIONS MANAGEMENT Lecture Notes #3 Production System Design.
1 14 Design of Experiments with Several Factors 14-1 Introduction 14-2 Factorial Experiments 14-3 Two-Factor Factorial Experiments Statistical analysis.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Assembly Line Balance Balance.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Chapter 6 Process Analysis.
1 © The McGraw-Hill Companies, Inc., 2004 Introduction (from Chase) Process Analysis.
1-1 1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved.
Dr. Cesar Malave Texas A & M University
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Sequencing Mixed Models & Unpaced Lines Active Learning Module 4 Dr. César O. Malavé Texas A&M University.
1 Slides used in class may be different from slides in student pack Chapter 5 Process Analysis  Process Analysis  Process Flowcharting  Categories of.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Approaches to Line balancing Optimal Solutions Active Learning Module 3 Dr. César O. Malavé Texas A&M University.
Assembly Lines – Reliable Serial Systems
Process Analysis CHAPTER 5. Learning Objectives 1. Recognize three basic types of processes: a serial flow process, parallel processes (such as what happens.
1 Distributed Process Management Chapter Distributed Global States Operating system cannot know the current state of all process in the distributed.
© The McGraw-Hill Companies, Inc., Technical Note 5 Facility Layout.
Process Analysis I Operations -- Prof. Juran.
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Approximate Three-Stage Model: Active Learning – Module 3 Dr. Cesar Malave Texas A & M University.
© The McGraw-Hill Companies, Inc., Technical Note 5 Facility Layout.
Operations Fall 2015 Bruce Duggan Providence University College.
Chapter 11 Managing Inventory throughout the Supply Chain
Statistics Sampling Distributions and Point Estimation of Parameters Contents, figures, and exercises come from the textbook: Applied Statistics and Probability.
Lesson  Shown at the right are the first six rows of Pascal’s triangle.  It contains many different patterns that have been studied for centuries.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
© 2010 Pearson Prentice Hall. All rights reserved Chapter Hypothesis Tests Regarding a Parameter 10.
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Chapter 5: Integration Section 5.1 An Area Problem; A Speed-Distance Problem An Area Problem An Area Problem (continued) Upper Sums and Lower Sums Overview.
Lecture 14 – Queuing Networks
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Chapter 5 Process Analysis. Chapter 5 Process Analysis.
CHAPTER 8 Pricing Decisions, Analyzing Customer Profitability, and Activity-Based Pricing.
Operations Management Work Measurement Supplement 10
Process Design and Analysis
Professor Arne Thesen, University of Wisconsin-Madison
FACILITY LAYOUT Facility layout means:
Chapter 5 Process Analysis.
IV-2 Manufacturing Systems modeling
Lecture 14 – Queuing Networks
Process Analysis “If you cannot describe what you are doing as a process, you do not know what you are doing.” W.E. Deming.
Capacity Planning For Products and Services
14 Design of Experiments with Several Factors CHAPTER OUTLINE
Chapter 5 Process Analysis.
Presentation transcript:

Two-Stage Paced Lines Active Learning – Module 2 Dr. Cesar Malave Texas A & M University

Background Material  Any Manufacturing systems book has a chapter that covers the introduction about the transfer lines and general serial systems.  Suggested Books: Chapter 3(Section 3.3) of Modeling and Analysis of Manufacturing Systems, by Ronald G.Askin and Charles R.Stanridge, John Wiley & Sons, Inc, Chapter 3 of Manufacturing Systems Engineering, by Stanley B.Gershwin, Prentice Hall, 1994.

Lecture Objectives  At the end of the lecture, every student should be able to Evaluate the effectiveness (availability) of a transfer line given  Buffer capacity  Failure rates for the work stations  Repair rates for the work stations Determine the optimal location of the buffer in any N stage transfer line.

Time Management  Readiness Assessment Test (RAT) - 5 minutes  Lecture on Paced Lines with buffers - 10 minutes  Spot Exercise - 5 minutes  Paced Lines with buffers (contd..) – 10 minutes  Team Exercise - 10 minutes  Homework Discussion - 5 minutes  Conclusion - 5 minutes  Total Lecture Time - 50 minutes

Readiness Assessment Test (RAT)  Here are the possible reasons for a station to be down. Analyze each of these reasons and the importance of buffers in every case. Station Failure Total Line Failure Station Blocked Station Starved

RAT Analysis Station Failure: Fractured tool, quality out-of-control signal, missing/defective part program, or jammed mechanism. Although this station is down, other stations can operate if they are fed product by the buffer, and have space for sending completed product. Total Line Failure: All the stations are inoperative. A power outage or error in the central line controller would cause a total line failure. Station Blocked: On completion of a cycle, if station i is not able to pass the part to station i+1, station i is blocked. Failure of the handling system, failure of a downstream station prior to the next buffer, or failure of a downstream station with the intermediate buffer between these stations currently being full. Suppose station i+1 is down, and its input buffer is filled, then station i must remain idle while it waits for downstream space for the just completed part. Station Starved: Station i is starved if an upstream failure has halted the flow of parts into station i. Even if operational, the starved station will sit idle.

Two-Stage Paced Lines with Buffers  Two serial stages are separated by an inventory buffer.  Buffer reduces the dependence between the stations – blocking/starving effects are reduced.  Buffer state should be taken into account while calculating line effectiveness.  Markow Chain Model is used. Serial Stages Buffer

Assumptions and Conventions  Markow Chain Environment (s 1,s 2,z)  s i is the status for station i and z is the number of items in the buffer  W – station in working condition (operational) R – station in repair  Failures and Repairs occur at the end of a cycle  When a cycle starts, if both stations are working, station 2 receives its next part from station 1.  If station 1 is down, station 2 grabs a part from the buffer  If buffer is empty, station 2 is starved  If station 2 is down and station 1 is up, part from station 1 is sent to the buffer  If the buffer is full, station 1 becomes blocked

 Chapman – Kolmogorov result : steady-state balance equations S be the set of states of the system P(s) be the probability that the system is in state s p(u,v) is the transition probability from state u (beginning) to state v (ending) P(s1) =  P(s)*p(s,s1) The steady-state balance equations can be obtained by applying the above equation.

Transitions for Two-stage line with buffer At time t, both stations are working, the transitions include WW  WW: probability = (1 - α 1 )(1 - α 2 ) WW  WR: probability = (1 - α 1 )α 2 WW  RW: probability = α 1 (1 - α 2 ) Z, does not change  Station 1 is being repaired while station 2 is working RW  WW:  if Z = 0, then probability = b 1  if Z = x > 0, then probability = b 1 (1 - α 2 ), Z = x - 1 RW  RW:  if Z = 0, then probability = (1 - b 1 )  if Z = x > 0, then probability = (1 - b 1 )(1 - α 2 ), Z = x - 1 RW  RR:  if Z = x > 0, probability = (1 - b 1 )α 2, Z = x – 1  Example: P(WW0) = (1 - α 1 - α 2 ) P(WW0) + b 1 P(RW0) + b 1 P(RW0) Steady-state equation obtained by the Chapman-Kolmogorov Result

 Station 1 is working, while station 2 is repaired WR  WW:  if Z = 0, then probability = b 2  if Z > x = 0, then probability = (1 – α 1 ) b 2, Z = x + 1 WR  WR:  if Z = 0, then probability = 1 – b 2  if Z > x = 0, then probability = (1 – α 1 )(1 - b 2 ), Z = x + 1 WR  RR:  if Z > x = 0, probability = α 1 (1 - b 2 ), Z = x + 1  Both stations are being repaired RR  WR:  if Z = x = 0, probability = b 1 (1 - b 2 ), Z = x + 1 RR  RW:  if Z = x = 0, probability = (1 – b 1 ) b 2, Z = x + 1 RR  RR:  if Z = x = 0, probability = (1 – b 1 ) (1 - b 2 ), Z = x + 1

 System Effectiveness for a buffer of maximum size z can be calculated as  Buzacott’s closed-form expression for the effectiveness for a buffer of maximum size z : where and x i = α i / b i (ratio of average repair time to uptime), s = x 2 / x 1, r = a 2 / a 1

Spot Exercise  A paced assembly line has a cycle time of 3 minutes. The line has eight workstations and a buffer of capacity 10 is placed between the fourth and fifth workstations. Each station has a 1 percent chance of breaking down in any cycle. Repairs average 12 minutes. Estimate the number of good parts made per hour.

Solution Given: Cycle time C = 3 min (paced), m = 8, α i = 0.01, b = 0.25 Thus, Cycles/hr = (60 min/hr)/(3 min/cycle) = 20 cycles/hr Now, α 1 = 0.4, Z =10 and α 2 = 0.4 Effectiveness can be found from Buzacott’s closed form expression, where x = 0.04/0.25 = 0.16 and s = 1, r = 1 Hence, the number of parts/hr = E 10 * Cycles/hr = 16.40

System Reduction  Aggregation of a set of stations that must be jointly active or idle and which have a common repair rate, into a single station  Holds effective for all serial stations as well as stations that act as feeder stations for the main line  Aggregated failure rate is obtained by summing the individual failure rates  System Reduction Rules: Combination Rule Median Buffer Location Reversibility

 Combination Rule A set of stations without any intermittent buffers can be replaced with a single station and b j = b, provided all stations must stop if any individual station stops Single Line α 1 +α 2 = α 3 +α 4 +α 5 Feeder Line (unbuffered) α1α1 α2α2 α5α5 α4α4 α3α3 α2α2 α3α3 α1α1 α5α5 α4α4 α 1 + α 2 + α 3 + α 6 α 4 + α 5 α6α6

 Combination Rule(Contd..) Feeder Line (buffered) = α 2 +α 3 +α 4  Median Buffer Location If only one buffer is to be inserted, it should be placed in the middle of the line. The upper bound on availability is given by α4α4 α3α3 α2α2 α1α1 α1α1

 Median Buffer Location(Contd..) A median location is the one for which, if r is the last station before buffer and the two conditions below are satisfied  Reversibility If the direction of flow is reversed in a serial line, production rate remains the same.

Team Exercise  Consider a paced assembly system with four workstations. Mean cycles to failure are estimated to be 100, 200, 100 and 50 cycles, respectively. Repair times should average 8 cycles. Find line availability assuming no buffers. A buffer of size 5 would be profitable if availability increased by at least The buffer could be located after station 2 or 3. Which location is the best? Should the buffer be included?

Solution Given: α 1 = 0.01, α 2 = 0.005, α 3 = 0.01, α 4 = 0.02, b = for all i (a) Thus, E 0 = [1 + b -1 Σ α i ] -1 = [1 + 8(0.045)] -1 = (b) According to the median location rule, the buffer should be located after station 3. Now, α 1 = ( ), Z = 5 and α 2 = 0.02 Effectiveness can be found from Buzacott’s closed form expression, where s = 0.8, x 1 = 0.2, x 2 = 0.16 and C = Now, E 5 – E 0 = < 0.04, and do not include the buffer

Homework  A 10 stage transfer line is being considered with failure rates  i = ( i =1,2,..,10) and b j = 0.2 ( i =1,2,..,10). Estimate the following Effectiveness of the line without buffers Effectiveness of the line with a buffer size of 5 after the station 5 Effectiveness of the line with a buffer size of 5 after the station 3 Optimal location of the buffer

Conclusion  Buffers allow for partial independence between the stages in the line, thereby improving line effectiveness against station failures  The size of the buffer may have an extreme influence on a flow production system. The importance of buffers increases with the amount of variability inherent in the system.  Although buffer involvement leads to considerable investment and factory space, it is crucial to find the optimal number and distribution of the buffers within a flow production system.