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.

Slides:



Advertisements
Similar presentations
2.7 Linear Programming.
Advertisements

Optimization problems using excel solver
1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
LINEAR PROGRAMMING (LP)
Introduction to Mathematical Programming
Transportation Problem and Related Topics. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics There are 3 plants, 3 warehouses.
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 5 Sensitivity Analysis: An Applied Approach to accompany Introduction to.
Linear Programming.
Planning with Linear Programming
Linear Programming Problem
Lesson 11 Multicriteria Decisions within LP Framework.
Sunk -versus- Variable Costs Only the variable costs are relevant in optimization models. Sunk costs do not need to be added as a separate term in the.
Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 10 Introduction to Sensitivity Analysis.
Session II – Introduction to Linear Programming
Copyright © 2008, The McGraw-Hill Companies, Inc.McGraw-Hill/Irwin Appendix B Profitability Analysis.
Copyright © 2006, The McGraw-Hill Companies, Inc.McGraw-Hill/Irwin 11 th Edition Appendix B.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 6 LP Assumptions.
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.
23–1. 23–2 Chapter Twenty-Three Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
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.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
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.
QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.
Linear Programming Example 2 Alternate Optimal Solutions.
THEORY OF CONSTRAINTS PROF DR FILIP ROODHOOFT. © Vlerick Business School THEORY OF CONSTRAINTS Philosophy Optimise the performance by managing the bottlenecks.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
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.
Resource Allocation Decisions Managerial Accounting Prepared by Diane Tanner University of North Florida Chapter 9.
Financial and Cost-Volume-Profit Models
PowerPoint Authors: Susan Coomer Galbreath, Ph.D., CPA Charles W. Caldwell, D.B.A., CMA Jon A. Booker, Ph.D., CPA, CIA Cynthia J. Rooney, Ph.D., CPA Copyright.
Ardavan Asef-Vaziri Systems and Operations Management
Decision Making via Linear Programming: A simple introduction Fred Phillips
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.
Linear Programming.  Linear Programming provides methods for allocating limited resources among competing activities in an optimal way.  Any problem.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
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.
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
The Theory of Constraints
Lab 3 Solver Add-In In Excel ► Lab 2 Review ► Solver Add-in Introduction ► Practice Solver following Instructor » Saferly Inc.
ENGM 631 Optimization Ch. 3: Introduction to Linear Programming.
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
LINEAR PROGRAMMING.
Integer Programming. 2 Ardavan Asef-Vaziri June-2013Integer Programming Computationally speaking, we can partition problems into two categories. Easy.
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1n X n
1 Ardavan Asef-Vaziri June-2013LP-Formulation Additional Problems.
Linear Programming Wyndor Glass Co. 3 plants 2 new products –Product 1: glass door with aluminum framing –Product 2: 4x6 foot wood frame window.
Class 10: Introduction to Linear Programming
Ardavan Asef-Vaziri Systems and Operations Management
Linear Programming Topics General optimization model
The Theory of Constraints
Cost Concepts for Decision Making
Synchronous Manufacturing
Linear Programming Wyndor Glass Co. 3 plants 2 new products
Linear Programming Topics General optimization model
Linear Programming Topics General optimization model
Linear Programming Topics General optimization model
The Goal.
Operations Research Models
Linear Programming.
Linear Optimization using Excel
Presentation transcript:

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 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 Practice: A Production System Manufacturing Two Products, P and Q 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 1. Identify The Constraint(s) Contribution Margin: P($45), Q($55) Market Demand: P(110), Q(60) Can we satisfy the demand? Resource requirements for 110 P’s and 60 Q’s:  Resource A: 110 (15) + 60 (10) =2250 minutes  Resource B: 110(10) + 60(35) = 3200 minutes  Resource C: 110(15) + 60(5) = 1950 minutes  Resource D: 110(10) + 60(5) = 1400 minutes

3 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Resource B is Constrained - Bottleneck Product P Q Profit $ Resource B needed (min) Profit per min of Bottleneck 45/10 =4.5 55/35 =1.6 Per unit of bottleneck Product P creates more profit than Product Q Produce as much as P, then Q 2. Exploit the Constraint : Find the Throughput World’s Best Solution

4 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics For 110 units of P, need 110 (10) = 1100 min. on B, leaving 1300 min. on B, for product Q. Each unit of Q requires 35 minutes on B. So, we can produce 1300/35 = units of Q. We get 110(45) (55) = 6993 per week. After factoring in operating expense ($6,000), we make $993 profit. 2. Exploit the Constraint : Find the World’s Best Solution to Throughput

5 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics  How much additional profit can we make if market for P increases from 110 to 111; by 1 unit.  We need 1(10) = 10 more minutes of resource B.  We need to subtract 10 min of the time allocated to Q and allocate it to P.  For each unit of Q we need 35 min of resource B.  Our Q production is reduced by 10/35 = 0.29 unit.  One unit increase in P generates $45. But $55 is lost for each unit reduction in Q. Therefore if market for P is 111 our profit will increase by 45(1)-55(0.29) = $ Exploit the Constraint : Find the World’s Best Solution to Throughput

6 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Decision Variables x1 : Volume of Product P x2 : Volume of Product Q Resource A 15 x x2  2400 Resource B 10 x x2  2400 Resource C 15 x1 + 5 x2  2400 Resource D 10 x1 + 5 x2  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 Practice: LP Formulation

7 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Practice: Optimal Solution Continue solving the problem, by assuming the same assumptions of 20% discount for the Japanese market.

8 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics A Practice on Sensitivity Analysis What is the value of the objective function? Z= 45(?) + 55(37.14)-6000! 2400(0)+ 2400(1.571)+2400(0) +2400(0)+110(29.286)+ 60(0) =6993 Is the objective function Z = 6993? = 993

9 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics A Practice on Sensitivity Analysis How many units of product P? What is the value of the objective function? Z= 45(???) + 55(37.14)-6000 = X1= 4950 X1 = 110

10 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Step 4 : Elevate the Constraint(s). Do We Try To Sell In Japan? $/Constraint Minute Even without increasing capacity of B, we can increase our profit.

11 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics For 110 units of P, need 110 (10) = 1100 min. on B, leaving 1300 min. on B, for product P in Japan. Each unit of PJ requires 10 minutes on B. So, we can produce 1300/10 = 130 units of PJ. We get 110(45) +130(27) = $ $6000 = $2460 profit. Check if there is another constraint that would not allow us to collect that much profit. Let’s see. 2. Exploit the Constraint : Find the World’s Best Solution to Throughput

12 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics 1. Identify The Constraint(s) Contribution Margin: P($45), PJ($27) Market Demand: P(110), PJ(infinity) Can we satisfy the demand? Resource requirements for 110 P’s and 130 PJ’s:  Resource A: 110 (15) (15) = 3600 minutes  Resource B: 110(10) + 130(10) = 2400 minutes  Resource C: 110(15) + 130(15) = 3600 minutes  Resource D: 110(10) + 130(10) = 2400 minutes  We need to use LP to find the optimal Solution.

13 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Step 4 : Exploit the Constraint(s). Not $2460 profit, but $1345. The $6000 is included. Let’s buy another machine B at investment cost of $100,000, and operating cost of $400 per week. Weekly operating expense $6400. How soon do we recover investment?

14 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Original Profit: $993 No Machine but going to Japan: $1345 profit. Buy a machine B: $2829 profit. The $6400 is included. Going to Japan has no additional cost. Buying additional machine has initial investment and weekly operating costs. $2829-$1345 = $1484  $100,000/$1484 = 67.4 weeks Step 4 : Elevate the Constraint(s). New Constraint

15 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Also add one machine A. Initial investment 100,000. Operating cost $400/week. Buying a machine A at the same cost From $2829 to $3533 = $ $2829 = $704. The $6800 included.. $100,000/$704 = 142 weeks Now B & C are a bottleneck