Bottleneck Analysis and Theory of Constraints

Slides:



Advertisements
Similar presentations
S7 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall Process Strategies ( process, repetitive, product) The objective of the process strategy.
Advertisements

6 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Capacity Planning (Long-Term Capacity Planning) 6.
Example: Receiving goods to warehouse Detailed view Receive Goods Inspect Goods (30) Match order? (10) Supervisor Report (5) Quality Check (45) Accept?
Process Strategies How to produce a product or provide a service that
7 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Constraint Management (Short-term Capacity Planning) 7.
S7 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall S7 Capacity and Constraint Management PowerPoint presentation to accompany Heizer and.
Chapter 18 Synchronous Manufacturing and the Theory of Constraints
7 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Constraint Management 7 For Operations Management, 9e by Krajewski/Ritzman/Malhotra.
© The McGraw-Hill Companies, Inc., Synchronous Manufacturing and Theory of Constraints.
Operating Processes process  A process is a set of tasks to be performed in a defined sequence  A process uses inputs to create outputs that are of value.
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
Capacity and Constraint Management
LSM733-PRODUCTION OPERATIONS MANAGEMENT By: OSMAN BIN SAIF LECTURE 29 1.
S7 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall S7 Capacity and Constraint Management PowerPoint presentation to accompany Heizer and.
Process Analysis process  A process is a set of tasks to be performed in a defined sequence  Process analysis describes how a process is doing and can.
TOC 1 Theory Of Constraints. TOC 2 Theory of Constraints How does TOC differ from the conventional shop control theory? Throughput definition * Emphasis.
S7 - 1© 2014 Pearson Education, Inc. Capacity and Constraint Management PowerPoint presentation to accompany Heizer and Render Operations Management, Eleventh.
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall. Chapter 2 Multiplying and Dividing Fractions.
S7 - 1 Course Title: Production and Operations Management Course Code: MGT 362 Course Book: Operations Management 10 th Edition. By Jay Heizer & Barry.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Synchronous Manufacturing and Theory of Constraints
7 Capacity Planning PowerPoint presentation to accompany
Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall. Section 6.1 Composite Functions.
© The McGraw-Hill Companies, Inc., Chapter 17 Synchronous Manufacturing and the Theory of Constraints.
S7 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall S7 Capacity and Constraint Management yl.
S7 - 1© 2014 Pearson Education Capacity Planning PowerPoint presentation to accompany Heizer and Render Operations Management, Global Edition, Eleventh.
Chapter 7s Class 1.
Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall. Section 1.3 Complex Numbers Quadratic Equations in the Complex Number System.
Suppl Capacity Planning Heizer and Render Principles of Operations Management, 8e PowerPoint slides by Jeff Heyl.
S7 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall S7 Capacity and Constraint Management PowerPoint presentation to accompany Heizer and.
Constraint Management Chapter 7 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall
S7 - 1 Capacity Planning PowerPoint presentation to accompany Heizer and Render Operations Management, Global Edition, Eleventh Edition Principles of Operations.
MGT 657 operations management Lecture 6b
The Inverse Trigonometric Functions (Continued)
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Synchronous Manufacturing and Theory of Constraints
© 2015 Pearson Education, Inc.
7 3 Capacity Planning PowerPoint presentation to accompany
Sinusoidal Curve Fitting
Section 9.1 Polar Coordinates
Section R.8 nth Roots; Rational Exponents
© 2015 Pearson Education, Inc.
Synchronous Manufacturing
Building Exponential, Logarithmic, and Logistic Models from Data
The Inverse Sine, Cosine, and Tangent Functions
Basic Matrix Operations
Section 2.4 Circles Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall.
Equations Quadratic in Form Absolute Value Equations
Section 8.3 The Law of Cosines
Section 11.8 Linear Programming
Equations Quadratic in Form Absolute Value Equations
Copyright © 2008 Pearson Prentice Hall Inc.
Copyright © 2008 Pearson Prentice Hall Inc.
Section 2.2 The Graph of a Function
Section 2.2 The Graph of a Function
Mathematical Models: Building Functions
Copyright © 2008 Pearson Prentice Hall Inc.
Copyright © 2008 Pearson Prentice Hall Inc.
Partial Fraction Decomposition
Section 3.2 The Graph of a Function
Sinusoidal Curve Fitting
Systems of Linear Equations: Matrices
Quadratic Equations in the Complex Number System
Partial Fraction Decomposition
Properties of Rational Functions
Copyright © 2008 Pearson Prentice Hall Inc.
Copyright © 2008 Pearson Prentice Hall Inc.
The Inverse Trigonometric Functions (Continued)
The Inverse Sine, Cosine, and Tangent Functions
Synchronous Manufacturing and Theory of Constraints
Presentation transcript:

Bottleneck Analysis and Theory of Constraints Each work area has its own unique capacity based on the station process time required Capacity analysis determines the throughput capacity of workstations in a system A bottleneck is a limiting factor or constraint A bottleneck has the lowest effective capacity in a system

Process Times for Stations, Systems, and Cycles The process time of a station is the time it takes to produce a unit at that workstation The bottleneck time is the time of the longest process time in the system The throughput time is the time it takes for a product to go through production from start to end (assuming no waiting)

A Four-Station Assembly Line 20 min/unit 8 min/unit 15 min/unit A B C 10 min/unit D

Capacity Analysis Two identical sandwich lines Each line has two workers and a toaster to perform the three operations All completed sandwiches are wrapped Wrap 37.5 sec/sandwich Order 30 sec/sandwich Bread Fill Toast 15 sec/sandwich 20 sec/sandwich 40 sec/sandwich © 2011 Pearson Education, Inc. publishing as Prentice Hall

Capacity Analysis With Parallel Stations The bottleneck is the operation with the longest process time after dividing by the number of parallel operations The system capacity is the inverse of the bottleneck time The throughput time is the total time through the longest path in the system, assuming no waiting

Capacity Analysis Wrap 37.5 sec Order 30 sec Bread Fill Toast 15 sec 20 sec 40 sec Toast work station has the longest processing time – 40 seconds The two lines each deliver a sandwich every 40 seconds so the process time of the combined lines is 40/2 = 20 seconds At 37.5 seconds, wrapping and delivery has the longest processing time and is the bottleneck Capacity per hour is 3,600 seconds/37.5 seconds/sandwich = 96 sandwiches per hour Throughput time is 30 + 15 + 20 + 40 + 37.5 = 142.5 seconds © 2011 Pearson Education, Inc. publishing as Prentice Hall

Bottleneck Management Release work orders to the system at the pace set by the bottleneck Lost time at the bottleneck represents lost time for the whole system Increasing the capacity of a non-bottleneck station is a mirage Increasing the capacity of a bottleneck increases the capacity of the whole system Effective capacity at a station is increased by decreasing the process time.

Theory of Constraints Five-step process for recognizing and managing limitations Step 1: Identify the constraint Step 2: Develop a plan for overcoming the constraints Step 3: Focus resources on accomplishing Step 2 Step 4: Reduce the effects of constraints by offloading work or expanding capability Step 5: Once overcome, go back to Step 1 and find new constraints