Previously in Chapter 4 Assignment Problems Network Flow Problems Vehicle Routing Problems Transportation Problems Staffing Problems.

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
Chapter 3 Workforce scheduling.
BA 452 Lesson B.3 Integer Programming 11ReadingsReadings Chapter 7 Integer Linear Programming.
Linear Programming Models & Case Studies
Transportation, Transshipment and Assignment Models and Assignment Models.
HAROSA 2013 Barcelona July WORKFORCE PLANNING AND SCHEDULING WITH CROSS-TRAINING AND LEARNING Scott E. Grasman Industrial & Systems Engineering Rochester.
1 Network Models Chapter Introduction A network problem is one that can be represented by... Nodes Arcs Function on Arcs.
Session 3a Decision Models -- Prof. Juran.
© 2004 Prentice-Hall, Inc. 8-1 Chapter 8 Aggregate Planning in the Supply Chain Supply Chain Management (3rd Edition)
IES 371 Engineering Management Chapter 14: Aggregate Planning
3. Aggregate Planning. Aggregate Planning  Provides the quantity and timing of production for intermediate future Usually 3 to 18 months into future.
PRODUCTION AND OPERATIONS MANAGEMENT
Aggregate Planning.
Ardavan Asef-Vaziri Systems and Operations Management
Linear Programming Using the Excel Solver
Chapter 8 Aggregate Planning in a Supply Chain
Linear Programming Introduction George B Dantzig developed LP in It is a problem solving approach designed to help managers/decision makers in planning.
Introduction to Management Science
Introduction to Management Science
ISM 206 Optimization Theory and Applications Fall 2005 Lecture 1: Introduction.
ISM 206 Optimization Theory and Applications Spring 2005 Lecture 1: Introduction.
Math443/543 Mathematical Modeling and Optimization
1 Contents College 9 Chapter 9 additional (sheets): –workforce planning –resource loading.
Previously in Chapter 4 Assignment Problems Network Flow Problems Sequential Decision Problems Vehicle Routing Problems Transportation Problems Staffing.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Agenda Office Hours: Friday 2-3 Final: Friday 4pm - Sat. 4pm.
© 2000 by Prentice-Hall Inc Russell/Taylor Oper Mgt 3/e Chapter 11 Capacity Planning And Aggregate Production Planning.
Previously in IEMS 310… Notation of optimization problems Linear Programs –Sensitivity Analysis / Duality –Assignment and Network Flow Problems Tricks:
INTRODUCTION TO LINEAR PROGRAMMING
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
MT 340: Quantitative Methods Dr. Caulk Quantitative Decision Making 7 th ed by Lapin and Whisler.
Previously in IEMS 310… Notation of optimization problems Linear Programs Sensitivity Analysis Duality Piecewise linear functions Assignment Problems.
Optimization II. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Optimization Extensions Multiperiod Models –Operations.
Pricing and revenue optimization. Course outline Basic price optimization, examples Looks at pricing the product depending on the cost and demand structure.
Introduction to Mathematical Programming OR/MA 504 Chapter 5 Integer Linear Programming.
Linear Programming David Kauchak cs161 Summer 2009.
Murat Kaya, Sabancı Üniversitesi 1 MS 401 Production and Service Systems Operations Spring Aggregate Production Planning (APP) Slide Set #8.
Modeling and Optimization of Aggregate Production Planning – A Genetic Algorithm Approach B. Fahimnia, L.H.S. Luong, and R. M. Marian.
1 Chapter-4: Network Flow Modeling & Optimization Deep Medhi and Karthik Ramasamy August © D. Medhi & K. Ramasamy, 2007.
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
Chapter 9 - Multicriteria Decision Making 1 Chapter 9 Multicriteria Decision Making Introduction to Management Science 8th Edition by Bernard W. Taylor.
MGTSC 352 Lecture 10: Aggregate Planning Leduc Control Example: Complete post-optimality analysis Case 2: Mountain Wear Set up and use solver to find minimum.
MANGT 521 (B): Quantitative Management
Announcements Appeals on Q8 based on correct calculation with bad input will be heard Appeals will not be successful on the basis of: –Running out of time.
MGTSC 352 Lecture 14: Aggregate Planning WestPlast Case H ow to deal with multiple objectives How to use binary variables AltaMetal Case Aggregating into.
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
4-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Modeling Examples Chapter 4- Part2.
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.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
OSCM 230 Fall 2013 Management Science Lecture 4 Linear Programming II 9/11/2013, 9/16/ Lecture 4 Linear Programming II Professor Dong Washington.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
Chapter 13 Aggregate Planning.
14-1 McGraw-Hill Ryerson Operations Management, 2 nd Canadian Edition, by Stevenson & Hojati Copyright © 2004 by The McGraw-Hill Companies, Inc. All rights.
Linear Programming Chapter 1 Introduction.
-114- HMP654/EXECMAS Linear Programming Linear programming is a mathematical technique that allows the decision maker to allocate scarce resources in such.
14-1 McGraw-Hill/Irwin Operations Management, Seventh Edition, by William J. Stevenson Copyright © 2002 by The McGraw-Hill Companies, Inc. All rights reserved.
ISM 206 Optimization Theory and Applications Fall 2011 Lecture 1: Introduction.
Linear Programming Applications
1 Chapter 1 Introduction Exposure to quantitative methods will teach managers to ask the right questions. Quantitative Decision Making.
Lecture 20 Review of ISM 206 Optimization Theory and Applications.
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.
Introduction to Linear Programs
Goal programming.
Chapter 8 Aggregate Planning in the Supply Chain
Chapter 8 Aggregate Planning in the Supply Chain
Chapter 8 Aggregate Planning in the Supply Chain
Solving Linear Systems by Linear Combinations
Optimization II.
Presentation transcript:

Previously in Chapter 4 Assignment Problems Network Flow Problems Vehicle Routing Problems Transportation Problems Staffing Problems

Agenda Sensitivity Analysis Optimization tricks: If statements Diseconomy of Scale Projects Sequential Decision Processes –a.k.a. Production Planning

Sensitivity Analysis If you are missing these columns

Sensitivity Analysis

make sure it is checked

If statements (Part 1) Not in typical optimization formulation Harder for solvers minf(x 1,x 2,…,x n ) s.t.g 1 (x 1,x 2,…,x n ) ≤ b 1 g 2 (x 1,x 2,…,x n ) = b 2 … x 1 ≤0, x 3 binary, x 4 ≥0, x 4 integer, … (note that there is sign-constraint on x 2, sometimes we say “x 2 is a free variable”)

If statements (Part 2) 0 ≤x and If x≤b, then y=c, else y=d create binary 0/1 variable z add the constraints (b-x)/b ≤ z(if x≤b, then z=1) z≤1+(b-x)/b(if x>b, then z=0) y=cz+d(1-z)(if z=1, then y=c else y=d)

If statements (Part 3) Binary variables are hard for solvers –though better than if statements Sometimes can be avoided –for example: diseconomies of scale (certain piecewise linear functions)

Diseconomy of Scale quantity revenue or profit quantity cost mathematically equivalent

Economy of Scale revenue or profit quantity cost mathematically equivalent

Projects 10% of final grade (worth a couple of homeworks) Groups of up to 3 Topic areas: –optimization (should start around now) –stochastic models (later)

Optimization Projects airline scheduling asset allocation production planning class scheduling tournament setup design optimization comparing algorithms I will post more details online

Examples Airline scheduling –Virgin America network –2 flight/day per link –How many planes are needed? Asset Allocation –July ‘08 Northwestern endowment at $8b –How would you have invested it?

Todo Group should meet me discuss project negotiate deliverables and deadlines –earlier for optimization topics

Sequential Decision Process Discretize Time Variables for each period –for example: #workers W k, inventory level I k period k=12345…

Production Planning (4.12) 1.List time periods –maybe add an extra at beginning and end 2.List variables (things to keep track of) –states and actions 3.Make timeline for a single period 4.Add constraints –“laws of motion”: constraints connecting a period to the next 5.Add objective 6.Solve

Problem Summary Producing snow tires Monthly demand: Oct-March Goal: cheaply meet demand Decisions: –hire or fire, overtime, production quantity Inventory cost, trainees are less productive

Production Planning (4.12) 1.List time periods –maybe add an extra at beginning and end 2.List variables (things to keep track of) –states and actions 3.Make timeline for a single period 4.Add constraints –“laws of motion”: constraints connecting a period to the next 5.Add objective 6.Solve

Production Planning (4.12) 1.List time periods –maybe add an extra at beginning and end 2.List variables (things to keep track of) –states and actions 3.Make timeline for a single period 4.Add constraints –“laws of motion”: constraints connecting a period to the next 5.Add objective 6.Solve

Variables For each period # hired H k, #fired F k #trained and trainee workers –total #workers W k, #trained workers T k units produced overtime used –R k units produced with regular hours, –O k units produced with overtime inventory I k

Production Planning (4.12) 1.List time periods –maybe add an extra at beginning and end 2.List variables (things to keep track of) –states and actions 3.Make timeline for a single period 4.Add constraints –“laws of motion”: constraints connecting a period to the next 5.Add objective 6.Solve

Timeline Period k W k #workers H k #hired F k #fired Production Decision R k #units with regular time O k #units with overtime T k #trained workers I k #units inventory D k #units shipped next periodprev. period

Production Planning (4.12) 1.List time periods –maybe add an extra at beginning and end 2.List variables (things to keep track of) –states and actions 3.Make timeline for a single period 4.Add constraints –“laws of motion”: constraints connecting a period to the next 5.Add objective 6.Solve

Constraints Inventory: I 1 =0, I k+1 =I k +R k +O k -D k Meeting Demand: I k+1 ≥ 0 Workforce W 1 =90, W k+1 =W k +H k -F k T k =W k -F k, T 7 =100 Capacity R k ≤18T k +8H k O k ≤(18/4)T k Nonnegativity

Production Planning (4.12) 1.List time periods –maybe add an extra at beginning and end 2.List variables (things to keep track of) –states and actions 3.Make timeline for a single period 4.Add constraints –“laws of motion”: constraints connecting a period to the next 5.Add objective 6.Solve

Objective Hiring / Firing costs $3000*(H 1 +…+H 7 ) $7000*(F 1 +…+F 7 ) Compensation $2600*(W 2 +…+W 7 ) $2600*1.5*(O 1 +…+O 7 )/18 Inventory $40*(I 1 +…+I 7 )

Variations and Extensions Transportation Problem with delays Multiple products Multiple production steps Warehouses Everything combined