Previously in IEMS 310… Notation of optimization problems Linear Programs –Sensitivity Analysis / Duality –Assignment and Network Flow Problems Tricks:

Slides:



Advertisements
Similar presentations
BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
Advertisements

BA 452 Lesson B.3 Integer Programming 11ReadingsReadings Chapter 7 Integer Linear Programming.
Transportation, Transshipment and Assignment Models and Assignment Models.
1 Network Models Chapter Introduction A network problem is one that can be represented by... Nodes Arcs Function on Arcs.
Aggregate Planning in a Supply Chain
Chapter 13 Capacity and Aggregate Planning. Aggregate Production Planning (APP) Matches market demand to company resources Matches market demand to company.
PRODUCTION AND OPERATIONS MANAGEMENT
Aggregate Planning in a Supply Chain
Ardavan Asef-Vaziri Systems and Operations Management
ISEN 315 Spring 2011 Dr. Gary Gaukler. Introduction to Aggregate Planning Goal: To plan gross work force levels and set firm-wide production plans, based.
Chapter 8 Aggregate Planning in a Supply Chain
Linear Programming Example 5 Transportation Problem.
ISM 206 Optimization Theory and Applications Fall 2005 Lecture 1: Introduction.
Previously in Chapter 4 Assignment Problems Network Flow Problems Vehicle Routing Problems Transportation Problems Staffing Problems.
Math443/543 Mathematical Modeling and Optimization
Previously in Chapter 4 Assignment Problems Network Flow Problems Sequential Decision Problems Vehicle Routing Problems Transportation Problems Staffing.
Transportation Problems Dr. Ron Tibben-Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding.
Agenda Office Hours: Friday 2-3 Final: Friday 4pm - Sat. 4pm.
Agenda Office Hours: –M 4-5, W 5-6, F 2-3 Wednesday: case discussion –1 page memo per group Friday: another case? Today: –Final review –Will post another.
Linear Programming OPIM 310-Lecture 2 Instructor: Jose Cruz.
Previously in IEMS 310… Notation of optimization problems Linear Programs Sensitivity Analysis Duality Piecewise linear functions Assignment Problems.
TODAY IN ALGEBRA…  Learning Goal: 7.3 You will solve systems of linear equations by Elimination  Independent Practice  MID CH.7 TEST-MONDAY/TUESDAY!
ISEN 315 Spring 2011 Dr. Gary Gaukler. Review: Prototype LP Problem Desk manufacturer Regular and rolltop desks, made of wood Regular: 20 sqft pine, 16.
Intermediate-range capacity planning Usually covers a period of 12 months. Short range Intermediate range Long range Now2 months1 Year Aggregate Planning.
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.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 13 Aggregate Planning.
Planning Demand and Supply in a Supply Chain
LSM733-PRODUCTION OPERATIONS MANAGEMENT
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
3-1 Chapter 3 Aggregate Planning McGraw-Hill/Irwin Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.
Introduction to Linear Programming BSAD 141 Dave Novak.
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.
AGGREGATE PLANNING Rachmat A. Anggara 9th of April 2010.
Transportation Problems Dr. Ron Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding the.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
1 Announcements: The deadline for grad lecture notes was extended to Friday Nov. 9 at 3:30pm. Assignment #4 is posted: Due Thurs. Nov. 15. Nov is.
MANGT 521 (B): Quantitative Management
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Contents Introduction Aggregate planning problem
Production Planning Basic Inventory Model Workforce Scheduling Enhance Modeling Skills Dynamic Models.
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.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Example 1: The Absolute Value Function
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Planning Horizons Today3 Months 1 year5 years Planning Horizon Short-range plans Job assignments Ordering Job scheduling Dispatching Intermediate-range.
EMGT 5412 Operations Management Science Nonlinear Programming: Introduction Dincer Konur Engineering Management and Systems Engineering 1.
14-1 McGraw-Hill/Irwin Operations Management, Seventh Edition, by William J. Stevenson Copyright © 2002 by The McGraw-Hill Companies, Inc. All rights reserved.
Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Manufacturing Planning and Control MPC 6 th Edition Chapter.
ISM 206 Optimization Theory and Applications Fall 2011 Lecture 1: Introduction.
PERT / CPM – Time-Cost Tradeoffs BSAD 30 Dave Novak Source: Anderson et al., 2015 Quantitative Methods for Business 13 th edition – some slides are directly.
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.
9 Sales and Operations Planning: Planning Supply and Demand in a Supply Chain.
Planning Supply and Demand in a Supply Chain
A Multiperiod Production Problem
Aggregate Sales and Operations Planning
St. Edward’s University
Problem 1 Demand Total There are 20 full time employees, each can produce 10.
Introduction to Linear Programs
Chapter 8 Aggregate Planning in the Supply Chain
9 Sales and Operations Planning: Planning Supply and Demand in a Supply Chain.
OUTLINE Questions? Midterm Results Go over Midterm Go over Homework
Aggregate Production Planning by Linear Programming: Terminology
Transportation, Assignment and Network Models
Introduction Basic formulations Applications
MGTSC 352 Lecture 9: Aggregate Planning
Warm-up: State the domain.
Presentation transcript:

Previously in IEMS 310… Notation of optimization problems Linear Programs –Sensitivity Analysis / Duality –Assignment and Network Flow Problems Tricks: –Piecewise linear functions

Agenda Another trick: absolute value Another LP… –Sequential Decision Processes –… shortest path (Ch 5) and other dynamic programs

Logistics TA OH now Thurs 1:30-3:30 C236 Hw deadline remains Fri 5pm –mailbox or in person in C236 –use Blackboard drop-box for excel files Suggest start reading Ch Will discuss projects on Monday

Absolute Value Trick from Hw 2 error i = predicted by regression - y i penalize overestimates error i |error i | error i penalty i

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 )