Dynamic Workforce Planning Models

Slides:



Advertisements
Similar presentations
Introduction to LP Modeling
Advertisements

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.
Linear Programming Models
Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
Aggregate Planning Models
Example 7.3 Pricing Models | 7.2 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n Suits.
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.
Example 16.1 Forecasting Sales at Best Chips. Thomson/South-Western 2007 © South-Western/Cengage Learning © 2009Practical Management Science, Revised.
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 14.3 Football Production at the Pigskin Company
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.
Example 8.7 Cluster Analysis | 8.2 | 8.3 | 8.4 | 8.5 | 8.6 | CLUSTERS.XLS n This file contains demographic data on 49 of.
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.
Nonlinear Pricing Models
Example 4.4 Blending Models.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
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?
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
Linear Programming Models
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
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.
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.
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
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.
Example 2.3 An Ordering Decision with Quantity Discounts.
Example 15.7 Capital Budgeting at the Tatham Company Integer Programming Models.
Example 13.6a Houses Sold in the Midwest Exponential Smoothing.
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.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
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.
A Multiperiod Production Problem
Project Scheduling Models
Solver & Optimization Problems
Excel Solver IE 469 Spring 2017.
Excel Solver IE 469 Spring 2018.
Wyndor Example; Enter data
Excel Solver IE 469 Fall 2018.
Excel Solver IE 469 Spring 2019.
Presentation transcript:

Dynamic Workforce Planning Models Example 4.3 Dynamic Workforce Planning Models

Background Information CyberLinks is a chain of computer stores. During the next 5 months the following number of skilled repair hours will be needed: 6000 in January; 7000 in February; 8000 in March; 9500 in April; 11,000 in May. At the beginning of January, CyberLinks employees 50 skilled technicians. Each skilled technician can work up to 160 hours per month. To meet future demands, new technicians must be trained. It takes one month to train a new technician.

Background Information -- continued During the month of training, a trainee must be supervised for 50 hours by an experienced technician. Experienced technicians are paid $2000 per month and trainees are paid $1000 per month during their month of training. Historical data indicate that 5% of the company’s skilled technicians quit each month. CyberLinks wants to use LP to determine a training schedule that minimizes the cost of meeting the demands for the next five months.

Solution To model the company’s situation, we must keep track of the following: The number of workers trained each month The number of experiences workers on hand each month The number of skilled hours available to meet each month’s needs The monthly and total costs

CYBERLINKS.XLS This file shows the spreadsheet model for this problem. The spreadsheet figure on the next slide shows the model.

Developing the Model To develop this model, proceed as follows. Inputs. Enter all the input data in the range B4:B9 and in the HrsReqd range. Number of trainees each month. The only decision CyberLinks must make is the number of trainees to hire each month. This will automatically determine the number of skilled technicians needed each month. Therefore, enter any trial values for trainees in the Trainees range. Skilled technicians available each month. In cell B14 enter the formula =InitTechs This corresponds to the 50 workers available at the beginning of January. Now let St, Qt, and Tt be, respectively, the number of skilled workers available in month t, the number of quitters at the end of month t, and the number of trainees in month t.

Developing the Model -- continued Then we have the following balance equation: St = St-1 – Qt-1 +Tt-1 This follows because all of the trainees in month t – 1 are skilled by month t, and all but the quitters come back the following month. Use this relationship to computer the number of skilled technicians available during February by entering the following formula =B13+B14-B15 in cell C14. Then copy this formula to the range D14:F14 for the other months. Quitters each month. Calculate the number who quit at the end of month 1 in cell B15 with the formula =PctQuitters*B14 and copy this ti the range C15:F15 for the quitters in other months.

Developing the Model -- continued Hours for repair each month. Let Ht be the number of hours available for repair in month t. Then the following equation relates the number of hours available for repair to the number of skilled workers and the number of trainees Ht = 160St – 50Tt. Use this relationship to computer the available repair hours for January in cell B18 with the formula =HrsPerTech*B14 – HrsPerTrainee*B13. Then copy this formula to the range C18:F18 for the other months. Payroll costs. Computer the total payroll costs for skilled technicians and trainees in cells B23 and B24 with the formulas =UnitTechCost*SUM(Technicians) and =UnitTraineeCost*SUM(Trainees). Then sum these to get the total cost in the TotCost cell.

Developing the Model -- continued Using Solver: The Solver dialog box should appear as shown here.

Developing the Model -- continued Objective. Select the TotCost cell as the target cell to minimize. Changing cells. Select the Trainees range as changing cells. Skilled technician hour constraint. Enter the constraint HrsAvailable>=HrsReqd. This ensures that enough skilled technician hours are available each month to meet requirements. Specify nonnegativity and optimize. Under Solver Options, check the nonnegativity box, and use the LP algorithm to obtain the optimal solution shown.

Developing the Model -- continued We see that a minimum cost of $593,777 is obtained by the following training schedule: train 0 in January, 8.45 in February, 11.45 in March, 9.52 in April and 0 in May. If the number of trainees each month is required to be an integer, then we add the constraint that the Trainee range be integers. Unfortunately, there is still a problem – the number of skilled technicians during each month is still fractional. This is because of quitters.

Developing the Model -- continued When we multiply the number of skilled trainees by 0.05, we typically do not get integers. One possible remedy is to assume that approximately 5% quit, and implement this with Excel’s ROUND function. Specifically enter the formula =ROUND(PctQuitters*B14,0) in cell B15 and copy it across row 15. This rounds the first argument to 0 decimals. This model is now nonlinear, as Solver will remind you if you try to use the LP algorithm.

Developing the Model -- continued The logical solution is to use the GRG nonlinear algorithm. Although it is not guaranteed to work with models using the ROUND function, it does work here, giving the solution shown on the next slide. Note that this solution costs a little over $2,000 more than the solution without the integer constraints. Extra constraints cost money!

Sensitivity Analysis One interesting sensitivity analysis is to see how the number of trainees and the total cost vary with the percentage of quitters. We tried this by using SolverTable on the model that includes the ROUND function and integer constraints, letting the percentage of quitters vary from 0% to 10% in increments of 1%. The results appear in the top half of the following table.

Sensitivity Analysis -- continued The values in column H are the increases in total cost as the percentage of quitters increases. Do you believe these “bumpy” results? We didn’t. We thought it strange that total cost would first increase by $4000, then by $0, then by $4000, and so on. Therefore, we ran Solver “manually” on each of these problems, inputting each percentage of quitters in the PctQuitters cell. The results in the bottom half of the previous figure are similar,, but not identical, to the results from the SolverTable. Why the inconsistency?

Sensitivity Analysis -- continued Sooner or later, inconsistent results such as these will probably happen to you, so be ready and willing to do some detective work. We thought the problem was probably with Solver’s nonlinear algorithm not liking the ROUND function. However, this was not it. Upon careful inspection, we found that SolverTable uses input values that are slightly off from those specified, at least when the specified values involve decimals.

Sensitivity Analysis -- continued Inconsistencies like these can be a source of frustration or a learning experience. We favor the latter. Specifically, we learn how sensitive integer models can be to slight changes in inputs. Evidently, the model is on the edge of rounding up or down. In one case it evidently rounds down, and in the other it evidently rounds up.