Production Management Application by Aparna Asha. v Saritha Jinto Antony Kurian.

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Lesson 08 Linear Programming
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Linear Programming.
Linear Programming Problem
Linear Programming Models & Case Studies
Session II – Introduction to Linear Programming
CCMIII U2D4 Warmup This graph of a linear programming model consists of polygon ABCD and its interior. Under these constraints, at which point does the.
IES 371 Engineering Management Chapter 14: Aggregate Planning
Aggregate Production Planning
Chapter 5 Linear Inequalities and Linear Programming
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Linear Programming Problem Formulation.
Marketing Applications: Media selection
Aggregate Planning Ash Soni ODT Department Kelley School of Business.
Managerial Decision Modeling with Spreadsheets
Session 2b. Decision Models -- Prof. Juran2 Overview More Sensitivity Analysis –Solver Sensitivity Report More Malcolm Multi-period Models –Distillery.
19 Linear Programming CHAPTER
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
INTRODUCTION TO LINEAR PROGRAMMING
Linear Programming Applications
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Kerimcan OzcanMNGT 379 Operations Research1 LP: Sensitivity Analysis and Interpretation of Solution Chapter 3.
Chapter 19 Linear Programming McGraw-Hill/Irwin
IES 303 Engineering Management & Cost Analysis | Dr. Karndee Prichanont, SIIT 1 Learning Objectives:  Understand the concepts and methods of aggregate.
Product Mix Problem Monet company makes four types of frames.
Integer Programming Models
Product Mix & Master Production Scheduling
1 OM2, Supplementary Ch. C Modeling Using Linear Programming ©2010 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 Linear Programming Chapter 2 By Mohammad Shahid Khan M.Eco, MBA, B.Cs, B.Ed. Lecturer in Economics & Business Administration Department of Economics.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
Sensitivity Analysis Consider the CrossChek hockey stick production problem:   Management believes that CrossChek might only receive $120 profit from the.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Linear Programming last topic of the semester What is linear programming (LP)? Not about computer programming “Programming” means “planning” “Linear” refers.
MANGT 521 (B): Quantitative Management
DISTRIBUTION AND NETWORK MODELS (1/2)
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Arben Asllani University of Tennessee at Chattanooga Chapter 5 Business Analytics with Goal Programming Business Analytics with Management Science Models.
LINEAR PROGRAMMING.
Copyright © Cengage Learning. All rights reserved. 3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
1 LP-3 Symplex Method. 2  When decision variables are more than 2, it is always advisable to use Simplex Method to avoid lengthy graphical procedure.
1 Introduction To Linear Programming l Today many of the resources needed as inputs to operations are in limited supply. l Operations managers must understand.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
F2:Management Accounting. 2 Designed to give you knowledge and application of: Section F: Short–term decision–making techniques F1. Cost –Volume-Profit.
Chapter 4 The Simplex Algorithm and Goal Programming
Linear Programming Applications
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Engineering Economics (2+0)
Chapter 5 Linear Inequalities and Linear Programming
Duality Theory and Sensitivity Analysis
Introduction to Linear Programming
Linear Programming.
Presentation transcript:

Production Management Application by Aparna Asha. v Saritha Jinto Antony Kurian

Contents A Make-or-Buy Decision Production Scheduling Workforce Assignment

A Make-or-Buy Decision

QUESTION A company markets various business and engineering products. Currently it is preparing to introduce two new calculators: one for the business market called the Financial Manager and one for the engineering market called the Technician. Each calculator has three components: a base, an electronic cartridge, and a face plate or top. The same base is used for both calculators, but the cartridges and tops are different. All components can be manufactured by the company or purchased from the outside suppliers Financial Manager calculators and 2000 Technician calculators will be needed.

Contd: Manufacturing capacity is limited. The company has 200 hours of regular manufacturing time and 50 hours of overtime that can be scheduled for the calculators. Overtime involves a premium at the additional cost of $9 per hour. The problem for the company- to determine how many units of each component to manufacture and how many units of each component to purchase.

OBJECTIVE FUNCTION Decision Variables BM No. of bases manufactured BP No. of bases purchased FCM No. of Financial manager cartridges mfrd FCP No. of Financial manager cartridges prchd TCM No. of technician cartridges manufactured TCP No. of technician cartridges purchased FTM No. of financial manager tops manufactured FTP No. of financial manager tops purchased TTM No. of technician tops manufactured TTP No. of technician tops purchased OT No. of hours of overtime to be scheduled.

Objective of the decision maker To minimize the total cost, including manufacturing costs, purchase costs and overtime costs. Hence the objective function is: Min 0.5BM+0.6BP+3.75FCM+4FCP+3.3TCM+3.9TCP+0.6F TM+0.65FTP+0.75TTM+0.78TTP+9 OT

CONSTRAINTS Number of each component needed to satisfy the demand for 3000 FM calculators and 2000 Technician calculators. The five demand constraints are BM+BP =5000 Bases FCM+FCP=3000 FM cartridges TCM+TCP=2000 Technician cartridges FTM+FTP=3000 FM tops TTM+TTP=2000 Technician tops

Manufacturing capacities for regular time and overtime cannot be exceeded 1) Limits overtime capacity to 50 hours OT <= 50 2) Total manufacturing time required for all components must be less than or equal to the total manufacturing capacity ( regular time + overtime) BM+3FCM+2.5TCM+FTM+1.5TTM<=12,000+60OT ie, BM+3FCM+2.5TCM+FTM+1.5TTM-60OT<=12,000

Complete Formulation Min 0.5BM+0.6BP+3.75FCM+4FCP+3.3TCM+3.9TCP+0.6FTM+ 0.65FTP+0.75TTM+0.78TTP+9OT S.t. BM + BP = 5000 Bases FCM + FCP =3000 FC TCM + TCP = 2000 TC FTM + FTP = 3000 FT TTM + TTP = 2000 TT OT <= 50 Overtime hours BM+3FCM+2.5TCM+FTM+1.5TTM-60 OT <= 12,000 Manuftrng cpcty

Production Scheduling

One of the most important applications of linear programming deals with multiperiod planning such as production scheduling. Let us consider the case of Bollinger Electronics Company, which produces two different electronic components for a major airplane engine manufacturer. The airplane engine manufacturer notifies the Bollinger sales office each quarter of their monthly requirements for components for each of the next 3 months. The monthly requirements for the components may vary considerably, depending on the type of engine the airplane engine manufacturer is producing.

The table below shows the order that has been received for the next 3 month period. Three month demand schedule for Bollinger Electronics Company ComponentAprilMayJune 322A 802B

After the order is processed, a demand statement is sent to the production control department. The production control department must then develop a 3 month production plan for the components. In arriving at the desired schedules, the production manager will identify: Total production cost Inventory holding cost Change in production schedule cost

Let x im denote the production volume in units for product i in month m. Here i=1,2 and m=1,2,3; i=1 refers to component 322 A, i=2 refers to component 802B, m=1 refers to April, m=2 refers to May and m=3 refers to June.

If component 322A costs $20 per unit produced and component 802B costs $10 per unit produced, the total production cost part of the objective function is Total production cost= 20x11+20x12+20x13+10x21+10x22+10x23

In order to incorporate the relevant inventory holding cost into the model, let ‘Sim’denote the inventory level for the product ‘i ’ at the end of the month ‘m’. Bollinger has determined that the monthly inventory holding costs are 1.5% of the cost of the product,ie., (0.015)($20)=$0.30 per unit for the component 322A and (0.015)($10)=$0.15 per unit of component 802B..

A common assumption made in production scheduling is that the monthly inventories are an acceptable approximation of the average inventory levels throughout the month. Making this assumption the inventory holding cost portion of the objective function will be as follows: Inventory holding cost= 0.30s s s s s s23

To incorporate the costs of fluctuations in production levels from month to month, two more variables are defined: Im =increase in the total production levels during the month m Dm=decrease in the total production level during the month m After estimating the effects of employee layoffs,turnovers,reassignment training costs and other costs, Bollinger estimates that the cost of increase in production level for any month is $.0.50 per unit increase.Similarly the cost of decrease in production level for any month is estimated as $0.20 per unit decrease.

The third portion of the objective function will be: Change in production level costs- 0.50I I I D D D3 Combining all the costs, the complete objective function becomes: Min 20x x12 +20x13 +10x x x s s s s s s I I I D D D3

Constraints The units demanded can be expressed as: Ending inventory from previous month + Current production-Ending inventory for this month=This month’s demand Suppose the inventories at the beginning of the 3- month scheduling period were 500 units for component 322A and 200 units for component 802B. The demand for both products in the first month (April) was 1000 units, so the constraints for meeting demand in the first month becomes

500+x11-s11= x21-s21=1000 Moving the constants to the right side we have: X11-s11=500 X21-s21=800

Similarly demand constraints for second and third month: Month 2 S11+x12-s12=3000 S21+x22-s22=500 Month 3 S12+x13-s13=5000 S22+x23-s23=3000

If the company specifies a minimum inventory level at the end of the 3-month period of at least 400 units of component 322A and at least 200 units of component 802B,then S13>=400 S23>=200

Suppose if additional information on machine, labour and storage capacity is given: Month Machine Labour Storage capacity capacity capacity (hours) (hours) (square feet) April ,000 May ,000 June ,000

Machine, Labour and storage requirements Component Machine Labour Storage (hours/unit) (hours/unit) (square feet) 322A B

Then the constraints are: Machine capacity 0.10x x21<=400 Month x x22<=500 Month x x23<=600 Month 3 Labour capacity 0.05x x21<=300 Month x x22<=300 Month x x23<=300 Month 3 Storage capacity 2s11+3s21<=10,000 Month 1 2s12+3s22<=10,000 Month 2 2s13+3s23<=10,000 Month 3

One final set of constraints must be added to guarantee that Im and Dm will reflect the increase or decrease in the the total production level for month m. Suppose that the production level for March, the month before the start of the current production scheduling period, had been 1500 units of component 322A and 1000 units of component 802B for a total production level of =2500 units. We can find the change in production for April from the relationship April production-March production= Change Using the April production variables, x11 and x21 and the March production of 2500 units, we have (x11 +x21) = Change

A positive change reflects an increase in the total production level, and a negative change reflects a decrease in the total production level. We can use the increase in production for April, I1, and the decrease in production for April, D1, to specify the constraint for the change in total production for the month of April: (x11 +x21) – 2500= I1 – D1 We cannot have an increase in production and a decrease in production during the same month; thus either I1 OR D1 will be zero. This approach of denoting the change in production level as the difference between two non negative variables, I1 and D1, permits both positive and negative changes in the production level. If a single variable (like cm) had been used, only positive changes would be possible because of the nonnegativity requirement.

Using the same approach in May and June, we obtain the constraints for the second and third months of the production scheduling period: (x12 + x22) – (x11 + x21) = I2 –D2 (x13 +x23) – (x12 + x22) = I3 – D3 Placing the variables on the left-hand side and the constraints on the right-hand side yields the complete set of what is commonly referred to as production-smoothing constraints. x11 +x12 – I1 + D1 = x11 –x21 +x12 +x22 –I2 +D2 = 0 -x12 – x22 + x13 + x23 – I3 + D3 =0

Minimum-cost production schedule information for ActivityAprilMayJune Production Comp 322A Comp 802B Ending inventory-322A 802B Machine usage- scheduled hrs Slack capacity Labour usage-scheduled hrs Slack capacity Storage usage-scheduled storage Slack capacity

Workforce Assignment

Workforce assignment Important for managers to make decisions regarding staffing. Reduces the cost of labor if employees can be cross trained in two or more jobs. Not only optimal product mix, but also optimal workforce assignment.

Case overview McCormick manufacturing company produces two products with contributions to profit per unit of $10 and $9 respectively. The labor requirement per unit produced and the total hours of labor available from personnel assigned to each of four department are shown

Labor-Hours per unit DepartmentProduct1Product2Total Available Hours

Decision variable P 1 = units of products 1 P 2 = units of products 2 Objective function : To maximize profit Max Z = 10P 1 +9P 2 Subjected to constraints 0.65P P 2 <= P P 2 <= P P 2 <= P P 2 <= 1400

Non-negativity constraints P 1,P 2 >= 0 Optimal solution P 1 = 5744 P 2 = 1795 Z = $ 73,590

Slack/Surplus Department 3 & 4 are on max operation at capacity. Department 1 & 2 have a slack of appx 1062 and 1890 hours. Feasible solution Transfer labor hours from the departments which have slack to one’s which need more hours to increase the profit.

Cross training ability and capacity information From Department 1234Max hours transferable 1--Yes Yes Yes100 4Yes

Additional variables b i = the labor hours allocated to department i (i = 1,2,3,4) t ij = the labor hours transferred from department i to department j Writing the capacity constraints in terms of b 0.65P P 2 <= b P P 2 <= b P P 2 <= b P P 3 <= b 4 Bringing b i on to the left side of the inequalities for all the equations. 0.65P P 2 – b 1 <= 0 …………

b 1 = Hours initially in department 1 + hours transferred into department 1 – hours transferred out of department 2 b 1 = 6500+t 41 -t 12 -t 13 rewriting ….. b 1 -t 41 +t 12 +t 13 = 6500 b 2 -t 12 +t 42 +t 23 +t 24 = 6000 b 3 -t 13 -t 23 +t 34 = 7000 b 4 -t 24 -t 34 +t 41 +t 42 = 1400

Transfer capacity t 12 +t 13 <= 400 t 23 +t 24 <= 800 t 34 <= 100 t 41 +t 42 <= 200 Profits maximized from $73,590 to $ 84,011 P 1 = 6825 P 2 = 1751 Conclusion Not only the profits are maximized, but also the labor workforce is also optimized.

THANK YOU