Example 14.3 Football Production at the Pigskin Company

Slides:



Advertisements
Similar presentations
Dynamic Workforce Planning Models
Advertisements

Introduction to LP Modeling
A Multiperiod Production Problem
Network Models Robert Zimmer Room 6, 25 St James.
Lecture 3 Robert Zimmer Room 6, 25 St James. Introduction to Optimization Modeling.
Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
Aggregate Planning Models
Static Workforce Scheduling Models
Example 2.2 Estimating the Relationship between Price and Demand.
Wyndor Example; Enter data Organize the data for the model on the spreadsheet. Type in the coefficients of the constraints and the objective function.
Linear Programming Using the Excel Solver
Example 5.6 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 6.1 Capital Budgeting Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Tatham Company is considering seven.
Example 4.7 Data Envelopment Analysis (DEA) | 4.2 | 4.3 | 4.4 | 4.5 | Background Information n Consider a group of three hospitals.
Example 6.4 Plant and Warehouse Location Models | 6.2 | 6.3 | 6.5 | 6.6 | Background Information n Huntco produces tomato sauce.
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
Example 6.2 Fixed-Cost Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Great Threads Company is capable of manufacturing.
Example 5.3 More General Logistics Models | 5.2 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 5.5 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
QM B Linear Programming
Example 7.1 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n The Madison.
1 Linear Programming Using the software that comes with the book.
Example 9.1 Goal Programming | 9.3 | Background Information n The Leon Burnit Ad Agency is trying to determine a TV advertising schedule.
Example 7.6 Facility Location Models | 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information.
Spreadsheet Modeling & Decision Analysis:
Nonlinear Pricing Models
Example 4.4 Blending Models.
Example 15.2 Blending Oil Products at Chandler Oil
Example 14.1 Introduction to LP Modeling. 14.1a14.1a | 14.2 | Linear Programming n Linear programming (LP) is a method of spreadsheet optimization.
3 Components for a Spreadsheet Linear Programming Problem There is one cell which can be identified as the Target or Set Cell, the single objective of.
Linear Programming The Industrial Revolution resulted in (eventually) -- large companies, large problems How to optimize the utilization of scarce resources?
Non-Linear Simultaneous Equations
Optimization II. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Optimization Extensions Multiperiod Models –Operations.
Transportation Models
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
Chapter 3 Introduction to Optimization Modeling
EXAMPLE: 3.1 ASSEMBLING AND TESTING COMPUTERS
Example 12.6 A Financial Planning Model | 12.2 | 12.3 | 12.4 | 12.5 | 12.7 |12.8 | 12.9 | | | | | | |
Chapter 19 Linear Programming McGraw-Hill/Irwin
Example 7.2 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n We continue.
Spreadsheets in Finance and Forecasting Presentation 8: Problem Solving.
Spreadsheet Modeling of Linear Programming (LP). Spreadsheet Modeling There is no exact one way to develop an LP spreadsheet model. We will work through.
Example 15.6 Managing Cash Flows at Fun Toys
Integer Programming Models
Example 4.5 Production Process Models | 4.2 | 4.3 | 4.4 | 4.6 | Background Information n Repco produces three drugs, A, B and.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc Chapter 3 Introduction to Optimization Modeling.
Unultiplying Whole Numbers © Math As A Second Language All Rights Reserved next #5 Taking the Fear out of Math 81 ÷ 9 Division.
Chapter © 2015 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or.
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
Example 5.8 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.9 | 5.10 | 5.10a a Background Information.
Linear Programming: Basic Concepts
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc Chapter 3 Introduction to Optimization Modeling.
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
Example 2.5 Decisions Involving the Time Value of Money.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Example 2.3 An Ordering Decision with Quantity Discounts.
MBA7020_12.ppt/July 25, 2005/Page 1 Georgia State University - Confidential MBA 7020 Business Analysis Foundations Optimization Modeling July 25, 2005.
Example 13.6a Houses Sold in the Midwest Exponential Smoothing.
Example 2.4 An Option Model for Hedging Investment Risk.
Example 16.6 Regression-Based Trend Models | 16.1a | 16.2 | 16.3 | 16.4 | 16.5 | 16.2a | 16.7 | 16.7a | 16.7b16.1a a16.7.
Chapter 4 Linear Programming Models. Example 4.1 – Advertising Model General Flakes Company advertises a low-fat breakfast cereal in a variety of 30 second.
Example 5.10 Project Scheduling Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10a a Background Information.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Example 3.1a Sensitivity Analysis and Solver Table Add-in.
Appendix A with Woodruff Edits Linear Programming Using the Excel Solver Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved.McGraw-Hill/Irwin.
A Multiperiod Production Problem
Project Scheduling Models
Linear Programming Excel Solver.
Presentation transcript:

Example 14.3 Football Production at the Pigskin Company A Multiperiod Production Problem

Objective To model and solve Pigskin’s production problem and then to perform interesting sensitivity analyses with SolverTable.

Background Information The Pigskin Company produces footballs. Pigskin must decide how many footballs to produce each month. It has decided to use a 6-month planning horizon. The forecasted demands for the next 6 months are 10,000, 15,000, 30,000, 35,000, 25,000, and 10,000. Pigskin wants to meet these demands on time, knowing that it currently has 5000 footballs in inventory and it can use a given month’s production to help meet the demand for the month.

Background Information -- continued During each month there is enough production capacity to produce up to 30,000 footballs, and there is enough storage capacity to store up to 10,000 footballs at the end of the month. The forecasted production costs per football for the next 6 months are $12.50, $12.55, $12.70, $12.80, $12.85, and $12.95, respectively. The holding cost per football held in inventory at the end of the month is figured at 5% of the production cost for that month.

Background Information -- continued The selling price for football is not considered relevant to the production decision because it is assumed that all demand will be met exactly when it occurs - at whatever the selling price is. Therefore, Pigskin wants to determine the production schedule that minimizes the total production and holding costs.

Solution In the traditional algebraic formulation, the decision variables are the production quantities for the 6 months, labeled P1 through P6. It is also convenient to let I1 through I6 be the corresponding end-of-the month inventories. Therefore the obvious constraints on production and storage capacities are Pj < = 300 and Ij < = 100 for each month j, 1 < = j < = 6. In addition to these constraints, we need “balance” constraints that relate the P’s and I’s.

Solution -- continued In any month the inventory from the previous month plus the current production must equal the current demand plus leftover inventory. If Dj is the forecasted demand for month j, then the balance equation for month j is Ij-1 + Pj = Dj + Ij The first of these constraints for month j=1, uses the known beginning inventory, 50, for all previous inventory (the Ij-1 term). By putting all the variables on the left and all known values on the right, these balance equations become

Solution -- continued P1 - I1 = 100-50 I1 + P2 - I2 = 150 I2 + P3 - I3 = 300 I3 + P4 - I4 = 350 I4 + P5 - I5 = 250 I5 + P6 - I6 = 100 All P’s and I’s must be nonnegative. Finally, the objective is obvious. It is the sum of unit production costs multiplied by P’s, plus the unit holding costs multiplied by I’s.

PIGSKIN1.XLS The spreadsheet version of Pigskin’s production problem is shown here and can be found in this file.

Developing the Spreadsheet Model The main feature that distinguishes this model from the product mix model is that some of the constraints, namely the balance equations, are built into the spreadsheet itself by means of formulas. In other words, the only changing cells are the production quantities. The ending inventories shown in row 21 are determined by the production quantities and equations.

Developing the Spreadsheet Model -- continued To form the spreadsheet we proceed as follows: Inputs. Enter the various inputs in range InitInv (B4), HolPct (B5), B9:G9, ProdCap (B15:G15), Demand (B19:G19), and InvCap (B23:G23). Production quantities. Enter any six values in the range Produced (B13:G13) as production quantities. On-hand inventory. Enter the formula =B4+B13 in cell B17. This calculates the first month on hand inventory after production. Then enter the “typical” formula =B21+C13 for on-hand inventory after production in month 2 in cell C17 and copy it across row 17.

Developing the Spreadsheet Model -- continued Ending Inventories. Enter the formula =B17-B19 for ending inventory in cell B21 and copy it to the range C21:G21. This formula calculates ending inventory in the current month as on-hand inventory before demand minus the demand in that month. Production and holding costs. Enter the formula =B9*B13 in cell B27 and copy it across to cell G27 to calculate the monthly productions costs. The enter the formula =$B$5*B9*B21 in cell B28 and copy it across to cell G28 to calculate the monthly holding costs. Note that these are based on monthly ending inventories. Finally, calculate the cost totals in row 28 by summing.

Developing the Spreadsheet Model -- continued The logic behind the constraints is now straightforward. All we have to guarantee is that production quantities are nonnegative and do not exceed the production capacities, the on-hand inventories after production are at least as large as demands, and ending inventories do not exceed storage capacities.

Using Solver To use Solver, fill out the dialog box as follows and then click on Solve. Model. Fill out the Solver dialog box as shown here. Of course, if we didn’t name ranges, we would refer directly to the corresponding cell addresses.

Using Solver -- continued Options. In the Solver Options dialog box, check the Assume Linear Model and Assume Non-Negative boxes. Note that the latter ensures only that the changing cells will be nonnegative. If we wanted to explicitly constrain the ending inventory cells to be nonnegative, we would have to add an extra constraint in the previous dialog box. However this constraint implicitly guaranteed by the Onhand>=Demand constraint, so it is not needed. The Solver solution appears on the next slide. This solution is also represented graphically.

Optimal Solution for Pigskin Production Problem

Graphical Representation of Optimal Production Schedule

Interpreting the Solution We can interpret the solution by comparing production quantities with demands. In month 1 Pigskin should produce just enough to meet month 1 demand (taking into account the inventory of 5000). In month 2 it should produce 5000 more footballs than month 2 demand, then in month 3 it should produce just enough to meet month 3 demand, still carrying the extra footballs in inventory from month 2 production. In month 4 Pigskin should finally use the 5000 footballs, along with the maximum production amount, 30,000, to meet month 4 demand.

Interpreting the Solution -- continued Then in months 5 an 6 it should produce exactly enough to meet these months’ demands. The total cost is $1,535,563, most of which is production cost. Could you have guessed that this is the optimal solution? Upon some reflection it makes perfect sense. Because the monthly holding costs are large relative to the differences in monthly production costs, there is little incentive to produce footballs before they are needed to take advantage of a “cheap” production month.

Interpreting the Solution -- continued Therefore, Solver tells us to produce footballs in months in which they are needed - when this is possible. The only exception to the rule is the 20,000 footballs produced during month 2 when only 15,000 are needed. The extra 5000 units produced during month 2 are needed, however, to meet month 3 demand. Thus, month 3 capacity is not available to meet month 4 demand, and 5000 units of month 2 capacity are used to meet month 4 demand.

Sensitivity Analysis We can again use the Solver/Table add-in to perform a sensitivity analysis. We illustrate two possibilities. First, note that the most inventory we ever carry at the end of a month is 5000 footballs, although storage capacity is 10,000 footballs. Perhaps this is because the holding cost percentage of 5% is fairly large. Would we carry more ending inventory if this holding cost was reduced. Or would we carry less if it was increased. We use Solver/Table to answer these questions. The only input cell is B5 and the single output we keep track of is the maximum ending inventory ever held which we calculate in cell B32 with =MAX(EndInv). As we will see in the output on the next slide, only when the percentage cost is 1% does the holding inventory increase, and even when it reaches 10% we will continue to hold the same.

Sensitivity of Maximum Ending Inventory to Holding Cost

Sensitivity Analysis -- continued A second possible sensitivity analysis is suggested by the way the optimal production schedule would probably be implemented. The optimal solution to Pigskin’s model specifies the production level for each of the next 6 months. In reality, however, the company might implement the model’s recommendation only for the first month. Then at the beginning of the second month, it will gather new forecasts for the next 6 months (that is, months 2 through 7), solve a new 6 month model, and again implements the model’s recommendation for the first of these months, month2. If it continues in this manner, we say that it is following a 6- month rolling planning horizon.

Final Question The question then is whether the assumed demand (really, forecast) toward the end of the planning horizon will have much effect on the optimal production quantity in month 1. We hope not since these forecasts could be quite inaccurate. The two-way table here shows how the optimal month 1 production quantity varies with the assumed demands in months 5 and 6.

Final Question -- continued As we see, if the assumed month 5 and 6 demands remain fairly small, the optimal month 1 production quantity remains at 5000. This is good news. It means that the optimal production quantity of month 1 is very insensitive to the possibly inaccurate forecasts in month 5 and 6.

Modeling Issue We assumed that Pigskin is using a 6-month planning horizon. Why 6 months? In multiperiod problems such as this, the company has to make forecasts about the future, such as the level of customer demand. Therefore, the length of the planning horizon is usually the length of time for which the company can make reasonably accurate forecasts. Here, Pigskin evidently believes that it can forecast up to 6 months from now, so it uses a 6-month planning horizon.