1 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Practice; Follow the 5 Steps Process Purchased Part $5 / unit RM1 $20 per unit RM2 $20 per.

Slides:



Advertisements
Similar presentations
2.7 Linear Programming.
Advertisements

1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 5 Sensitivity Analysis: An Applied Approach to accompany Introduction to.
OPSM 301 Operations Management
© 2007 Pearson Education Constraint Management Chapter 7.
SENSITIVITY ANALYSIS.
Copyright © 2006, The McGraw-Hill Companies, Inc.McGraw-Hill/Irwin 11 th Edition Appendix B.
LP EXAMPLES.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Integer Programming.
Systems Thinking and the Theory of Constraints Any intelligent fool can make things bigger, more complex, and more violent. It takes a touch of genius.
Finance 30210: Managerial Economics Optimization.
23–1. 23–2 Chapter Twenty-Three Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
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.
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
Linear and Integer Programming Models
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Linear Programming: Fundamentals
Throughput World. 2 Ardavan Asef-Vaziri Nov-2010Theory of Constraints: 2- Basics Systems Thinking and TOC  TOC Premise 1: The Goal of a business is to.
© The McGraw-Hill Companies, Inc., Synchronous Manufacturing and Theory of Constraints.
Systems Thinking and the Theory of Constraints Any intelligent fool can make things bigger, more complex, and more violent. It takes a touch of genius.
1 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Purchased Part $5 / unit RM1 $20 per unit RM2 $20 per unit RM3 $25 per unit $90 / unit 110.
Linear Programming Example 2 Alternate Optimal Solutions.
Linear-Programming Applications
Marketing Vocabulary. Market Advertise or promote an item or service.
Inventory System Inventory system: the set of policies and controls that monitor levels of inventory and determines: –what levels should be maintained.
Managerial Accounting: An Introduction To Concepts, Methods, And Uses
Network Flows Based on the book: Introduction to Management Science. Hillier & Hillier. McGraw-Hill.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Financial and Cost-Volume-Profit Models
Introduction to Theory of Constraints Competitive Manufacturing Management.
Decision Making via Linear Programming: A simple introduction Fred Phillips
Operations and Production Management
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Introduction to Theory of Constraints
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
Why Models? State of world: Data (not information!) overload Reliance on computers Allocation of responsibility (must justify decisions) Decisions and.
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 6 Sensitivity Analysis and Duality to accompany Introduction to Mathematical.
The McGraw-Hill Companies, Inc. 2006McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
Systems Thinking and the Theory of Constraints Any intelligent fool can make things bigger, more complex, and more violent. It takes a touch of genius.
Theory of constraints Slovak University of Technology Faculty of Material Science and Technology in Trnava.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Synchronous Manufacturing and Theory of Constraints
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
The Theory of Constraints
C H A P T E R 8 Evaluating Products and Processes Evaluating Products and Processes.
1 A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints. The linear model consists of the.
20-1 Inventory Management: Economic Order Quantity, JIT, and the Theory of Constraints 20.
© The McGraw-Hill Companies, Inc., Chapter 17 Synchronous Manufacturing and the Theory of Constraints.
M AKE VS BUY WEEK 10. Product RProduct S Selling price$12$20 Materials$4$11 Labour hours 24 Machine hours 43 I LLUSTRATIVE QUESTIONS Q 11.2 Maxitank makes.
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
LINEAR PROGRAMMING.
What is a Market? QCC’s:: 56. Objective Identify and Define Market, Marketing Concept, Industrial Market, Consumer Market, Market Share and Market Growth.
DP Johnson, 2005 Dealing with Production Bottlenecks Mini-case Be Sure To Review Notes Area And Related Word Document Forward to Instructors.
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
Linear Programming Applications
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Linear Programming Topics General optimization model
Introduction to Linear Programs
Synchronous Manufacturing and Theory of Constraints
Introduction to Theory of Constraints
The Theory of Constraints
Synchronous Manufacturing
Constraint Management
Linear Programming Topics General optimization model
Linear Programming Topics General optimization model
The Goal.
Synchronous Manufacturing and Theory of Constraints
Linear Optimization using Excel
Presentation transcript:

1 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Practice; Follow the 5 Steps Process Purchased Part $5 / unit RM1 $20 per unit RM2 $20 per unit RM3 $20 per unit $90 / unit 100 units / week $100 / unit 50 units / week P: Q: D 15 min. D 5 min. C 10 min. C 5 min. B 15 min. A B A 10 min. Time available at each work center: 2,400 minutes per week. Operating expenses per week: $6,000. All the resources cost the same

2 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics What Product to Produce? Sales View: Suppose you are the sales manager and you will be paid a 10% commission on the sales Price. What product do you recommend to produce? P: Sales Price = $90  commission /unit = $9 Q: Sales Price = $100  commission /unit = $10 Finance View: Suppose you are the financial manager and are in favor of the product with more profit per unit. P: Profit Margin = $  Profit Margin= $45 Q: Profit Margin = $  Profit Margin= $60

3 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics What Product to Produce? Production View: So, is the star and is the dog. First we’ll offer the star to the market. If we have residual capacity, we’ll offer the dog! Okay? Q P

4 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Cost World Solution For 50 units of Q, need 50 x = min. on B, leaving min. on B, for product P. Each unit of P requires minutes on B. So, we can produce units of P. If we sell units of Q and units of P, we get 50 x $60 + x $45 = $ per week. After factoring in operating expense ($6,000), we /15 = LOSE $300! 50 Go and Exploit the Constraint– Find the best way to use the constraint

5 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics 1. Identify The Constraint(s. Can We Meet the Demand of 100 Ps and 50Qs? Resource requirements for 100 P’s and 50 Q’s:  Resource A: 100 × + 50 × = minutes  Resource B: 100 × + 50 × = minutes  Resource C: 100 × + 50 × = minutes  Resource D: 100 × + 50 × = minutes

6 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics 2. Exploit the Constraint : Find the Throughput World Best Solution Decision Variables x 1 : Volume of Product P x 2 : Volume of Product Q Resource A 15 x x 2  2400 Resource B 15 x x 2  2400 Resource C 15 x x 2  2400 Resource D 15 x x 2  2400 Market for P x 1  100 Market for Q x 2  50 Objective Function Maximize Z = 45 x x Nonnegativity x 1  0, x 2  0

7 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics 2. Exploit the Constraint : Find the Throughput World Best Solution

8 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics 2. Exploit the Constraint : Find the Throughput World Best Solution  Choose the optimal product mix of 100P,30Q.  keep Resource B running at all times. Resource B can first work on RM2 for products P and Q, during which Resource A would be processing RM3 to feed Resource B to process RM3 for Q.  Never allow starvation of B by purchasing RM2 or by output of Process A. Never allow blockage of B by Process D- Assembly.  Minimize the number of switches (Setups) of Process B from RM2 to RM3 and vice versa.  Do not miss even a single order of Product P

9 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Step 3: Subordinate Everything Else to This Decision  Minimize variability at Process A.  Minimize variability in arrival of RM2

10 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics A Practice on Sensitivity Analysis What is the value of the objective function? Z= 45(100) + 60(?)-6000! Shadow prices? 2400(2)+2400(Shadow Price C) (Shadow Price D)+100(Shadow Price P) + 50(Shadow Price Q). 2400(0)+ 2400(2)+2400(0) +2400(0)+100(15)+ 50(0) = 6300 Is the objective function Z = 6300? = (Shadow Price A)+

11 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics A Practice on Sensitivity Analysis How many units of product Q? What is the value of the objective function? Z= 45(100) + 60(?)-6000 = X2-6000=300 60X2 = 1800 X2 = 30

12 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Step 4 : Elevate the Constraint(s)  The bottleneck has now been exploited  Besides Resource B, we have found a market bottleneck. Generate more demand for Product P Buy another Resource B  The Marketing Director Speaks Up : Another constraint in our company. It is the market.  A Great Market in Japan! Have to discount prices by 20%.

13 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Step 4 : Elevate the Constraint(s). Do We Try To Sell In Japan? $/Constraint Minute

14 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics  Right now, we can get at least $ per constraint minute in the domestic market.  So, should we go to Japan at all?  Okay, suppose we do not go to Japan. Is there something else we can do?  Let’s buy another machine! Which one?  Cost of the machine = $100,000.  Cost of operator: $400 per week.  What is weekly operating expense now?  How soon do we recover investment? Step 4 Perhaps not. 2 B $6,400

15 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Step 5:If a Constraint Was Broken in previous Steps, Go to Step 1 What is the payback period? /3000 = weeks What is the payback period? /( ) = weeks The domestic P had the max profit per minute on B. Why we have not satisfied all the domestic demand.

16 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Purchased Part $5 / unit RM1 $20 per unit RM2 $20 per unit RM3 $25 per unit $90 / unit 110 units / week $100 / unit 60 units / week P: Q: D 10 min. D 5 min. C 10 min. C 5 min. B 25 min. A 15 min. B 10 min. A A Production System Manufacturing Two Products, P and Q Problem 8 Time available at each work center: 2,400 minutes per week. Operating expenses per week: $6,000. All the resources cost the same

17 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Decision Variables x 1 : Volume of Product P x 2 : Volume of Product Q Resource A 15 x x 2  2400 Resource B 10 x x 2  2400 Resource C 15 x x 2  2400 Resource D 10 x x 2  2400 Market for P x 1  110 Market for Q x 2  60 Objective Function Maximize Z = 45 x x Nonnegativity x 1  0, x 2  0 Problem 8

18 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Problem 8