Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.

Slides:



Advertisements
Similar presentations
Dynamic Workforce Planning Models
Advertisements

Introduction to LP Modeling
A Multiperiod Production Problem
Static Workforce Scheduling Models
Example 2.2 Estimating the Relationship between Price and Demand.
BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
Chapter 3 Workforce scheduling.
Wyndor Example; Enter data Organize the data for the model on the spreadsheet. Type in the coefficients of the constraints and the objective function.
Operation Research By Anitha Chandran Chitra.R Radha.R Sudhit Sethi.
Introduction to Management Science
Microsoft Office 2007 Excel Chapter 8 Formula Auditing, Data Validation, and Complex Problem Solving.
Operations Management Linear Programming Module B - Part 2
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.
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.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
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.
Linear Programming The Industrial Revolution resulted in (eventually) -- large companies, large problems How to optimize the utilization of scarce resources?
Graphical Solutions Plot all constraints including nonnegativity ones
Transportation Models
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
Lectures Linear Programming. Preparation Linear Algebra.
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 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,
MIS 463: Decision Support Systems for Business Review of Linear Programming and Applications Aslı Sencer.
1 Chapter 11 A number of important scheduling problems... require the study of an astronomical number of arrangements to determine which one is best....
Transportation and Assignment Problems
MBA7020_12.ppt/July 25, 2005/Page 1 Georgia State University - Confidential MBA 7020 Business Analysis Foundations Optimization Modeling July 25, 2005.
Example 15.7 Capital Budgeting at the Tatham Company Integer Programming Models.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
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.
Math Programming Concept of Optimization (L.O. a ) Linear Programming Managerial Value of Information (L.O. d) Theory (L.O. b) Example Applications (L.O.
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.
Solving Linear Optimization Problems Using the Solver Add-in.
Formula Auditing, Data Validation, and Complex Problem Solving
A Multiperiod Production Problem
Project Scheduling Models
Solver & Optimization Problems
Excel Solver IE 469 Spring 2017.
Excel Solver.
Excel Solver IE 469 Spring 2018.
Wyndor Example; Enter data
Using WinQSB to solve Linear Programming Models
Excel Solver IE 469 Fall 2018.
Solving Linear Optimization Problems Using the Solver Add-in
Excel Solver IE 469 Spring 2019.
Presentation transcript:

Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Objective To use LP, with integer variables, to find the optimal schedule of employees to handle daily staffing requirements.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Background Information n A post office requires different numbers of full-time employees on different days of the week. n The number of full-time employees required each day is given in the table below.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Background Information -- continued n Union rules state that each full-time employee must work five consecutive days and then receive two days off. n The post office wants to meet its daily requirements using only full-time employees. n Its objective is to minimize the number of full-time employees that must be hired.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Solution n To model this problem in Excel we must keep track of the following: –number of employees starting work their 5-day ”shift” on each day of the week –number of employees working each day –total number of employees

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | POSTAL1.XLS n The spreadsheet model for this problem appears below and can be developed by following these steps:

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Developing the Model –Daily requirements. Enter the number of employees needed on each day of the week in the MinReqd range. –Employees starting each day. Enter any trial values for the number of employees starting their 5-day shift on each day of the week in the Starting range. –Employees on hand each day. The key to this solution is to realize that the numbers in the Starting range do not represent the number of workers who will show up each day. A simple way to see who shows up when, is to develop a table as in rows We link the values in the Starting range to the appropriate places in this table. We enter the formula $B$4 in B14 and copy it across to F14. We proceed for the other starting dates in rows Then we sum down each column to obtain the number of workers who work each day in row 21.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Developing the Model –Total employees. Calculate the total number of employees in cell B25 with the formula =SUM(Starting) n At this point, you might try rearranging the number in the Starting range to see if you can “guess” an optimal solution. It’s not that easy!

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Using Solver n Now that the model has been formulated, the Solver setup is straightforward. n We minimize the total number of employees, subject to having enough employees available to meet the minimal day requirements. n We also constrain the changing cells to be nonnegative and check the Assume Linear Model in the Solver Options dialog box. n Here is the solver dialog box selecting these options:

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Using Solver -- continued n The optimal solution is determined as follows.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | |

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Using Solver -- continued n To be realistic all values in the changing cells should be integers. Fortunately, this can be accomplished quite easily with Solver. n To require any of the cells to be integers, we add an extra constraint in the main Solver dialog box. Now we select “int” instead of = in the Add Constraint window.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Using Solver -- continued n With this extra constraint added, the optimal integer solution appears next. n This solution indicates that the post office needs to hire 23 full-time employees, and the Starting range shows how to schedule them. n The solution reveals an interesting aspect common to many optimization problems. n Because of irregular daily requirements and two- consecutive-days-off constraint, no solution can exactly match available workers to daily requirements.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | |

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Solution -- continued n Sometimes the optimal solution to a modeling problem isn’t the “perfect” solution we’re looking for, but it’s the best possible solution. n There is another interesting aspect to this problem. You may get a different solution that is still optimal - that is - it uses a total of 23 employees and meets all constraints. There are at least two optimal solutions and the one you obtain depends on the initial values you use in the changing cells. n This is the case of multiple optimal solutions and is not all uncommon in LP models.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Solution -- continued n Our model can easily be expanded to handle part- time employees, the use of overtime, alternative objective functions such as maximizing the number of weekend days off received by employees, and other possibilities. n One simple alternative version of the model is illustrated on the next slide.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | POSTAL2.XLS n The alternative spreadsheet model appears below.

| 15.3 | 15.4 | 15.5 | 15.6 | 15.7 | 15.8 | 15.9 | | Alternative Model n Instead of minimizing the number of workers on the payroll, we now pay a slightly larger wage on the weekend days and minimize the total weekly payroll. n The only difference in this model is that the formula for the total weekly payroll in cell B29 is now =B4*SUM(B25:F25) + B5*SUM(G25:H25) n Perhaps surprisingly, the optimal solution to this problem is the same as when we treated weekends and weekdays equally.