Preparing for Quiz 1 Review notes, assignments Take practice quiz Read Tips on Taking On-line Exams Get a good night's rest Quiz 1 coverage: up to and.

Slides:



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

Lecture 3 Linear Programming: Tutorial Simplex Method
OPSM 301 Operations Management
Topics to be Covered 1. Capacity Planning
Operations Management Dr. Ron Tibben-Lembke
IES 371 Engineering Management Chapter 14: Aggregate Planning
Chapter 12 Aggregate Planning.
Operations Management Aggregate Planning Chapter 13
PRODUCTION AND OPERATIONS MANAGEMENT
Aggregate Planning.
Ardavan Asef-Vaziri Systems and Operations Management
WEEK 11A – [S&OP] AGGREGATE PLANNING (CHAPTER 13) Planning levels (long, intermediate and short ranges and real time control); Planning & Control Model;
Operations Control Key Sources: Data Analysis and Decision Making (Albrigth, Winston and Zappe) An Introduction to Management Science: Quantitative Approaches.
Operations Management Linear Programming Module B - Part 2
1 Introduction to Operations Management Aggregate Planning CHAPTE R 12.
Aggregate Planning Ash Soni ODT Department Kelley School of Business.
© 2007 Pearson Education Chapter 14: Solving and Analyzing Optimization Models.
Example 14.3 Football Production at the Pigskin Company
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Three Classic Applications of LP Product Mix at Ponderosa Industrial –Considered limited.
Chapter 5 Aggregate Planning Operations Analysis Using MS Excel.
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.
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.
How Do I Find a Job to Apply to?
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.
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.
IES 303 Engineering Management & Cost Analysis | Dr. Karndee Prichanont, SIIT 1 Learning Objectives:  Understand the concepts and methods of aggregate.
Spreadsheet Modeling of Linear Programming (LP). Spreadsheet Modeling There is no exact one way to develop an LP spreadsheet model. We will work through.
Decision Making via Linear Programming: A simple introduction Fred Phillips
Aggregate Planning and Resource Planning Chapters 13 and 14.
Ardavan Asef-Vaziri Systems and Operations Management
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 13 Aggregate Planning.
OM4-1Aggregate Planning Chapter 14. OM4-2Aggregate Planning Planning Horizon Aggregate planning: Intermediate-range capacity planning, usually covering.
Operations Management
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
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.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
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.
Operations Management Aggregate Planning
3 Characteristics of an Optimization Problem General descriptionKPiller Illustration Decisions that must be made; represented by decision variables How.
Reading Assignment For after break read: Case 6: WestPlast (pg. 104) Case 8: Lot Sizing at Altametal (pg. 111)
MGTSC 352 Lecture 14: Aggregate Planning WestPlast Case H ow to deal with multiple objectives How to use binary variables AltaMetal Case Aggregating into.
Lab 3 Solver Add-In In Excel ► Lab 2 Review ► Solver Add-in Introduction ► Practice Solver following Instructor » Saferly Inc.
Capacity Planning. Capacity Capacity (I): is the upper limit on the load that an operating unit can handle. Capacity (I): is the upper limit on the load.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 10 Aggregate Planning and Master Scheduling
12-1Aggregate Planning William J. Stevenson Operations Management 8 th edition.
Preparing for Quiz 1 Review notes, assignments Take practice quiz Read Tips on Taking On-line Exams Get a good night's rest Quiz 1 coverage: up to and.
12-1Aggregate Planning William J. Stevenson Operations Management 8 th edition.
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.
Copyright © 2014 by McGraw-Hill Education (Asia). All rights reserved. 13 Aggregate Planning.
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.
EMGT 5412 Operations Management Science Nonlinear Programming: Introduction Dincer Konur Engineering Management and Systems Engineering 1.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Aggregate Planning and Master Scheduling Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 7 Aggregate Planning.
14-1 McGraw-Hill/Irwin Operations Management, Seventh Edition, by William J. Stevenson Copyright © 2002 by The McGraw-Hill Companies, Inc. All rights reserved.
Aggregate Planning. Session Break Up Aggregate Planning Master Production Schedule.
MGTSC 352 Lecture 15: Aggregate Planning Altametal Case
Chapter 14 Aggregate Planning.
Solver & Optimization Problems
Operations Management
Basic Strategies Level capacity strategy: Chase demand strategy:
13 Aggregate Planning.
OUTLINE Questions? Midterm Results Go over Midterm Go over Homework
Fundamentals of Production Planning and Control
Dr Sh Salleh bin Sh Ahmad
MGTSC 352 Lecture 9: Aggregate Planning
Presentation transcript:

Preparing for Quiz 1 Review notes, assignments Take practice quiz Read Tips on Taking On-line Exams Get a good night's rest Quiz 1 coverage: up to and including wrap-up of forecasting

Quiz Schedule Lab section Enter lab Quiz begins Quiz ends 8 am7:558:008:40 9 am8:559:009:40 11 am10:5511:0011:40 12 pm11:5512:0012:40 All lab sections treated the same Transition periods are crucial

When you come to the lab Find assigned computer, go to course web You may copy materials to the desktop before the quiz starts –From USB key, CD, or You may not use a USB key, CD, , etc. during the quiz Listen carefully to instructions Have OneCard ready.

When the quiz begins Take a deep breath! If the first question looks too simple, it is

During the quiz Keep breathing! Save often Submit early, submit often Do not worry about decimals, formatting Later questions may depend on earlier ones. Feel free to make up answers. If your computer freezes, raise your hand right away. You will be given extra time for computer problems beyond your control.

Near the end 5-minute warning Stop, save, submit Check that responses appear on confirmation web page If you have time, do more work Don’t risk late penalty ! When done: delete files from desktop

Things to watch for… Practice finding good solutions without Solver Error messages in Solver: –“Error in set target cell not met” –If you see a message you do not recognize, raise your hand immediately and we will help with the tech issue –Do not try to fix this for 20 min and then tell us since we will not be able to give you an extra 20 min on the quiz

Reminders Quiz Review Session, Thu 5:30 – 6:30 pm, BUS B –Optional –Q&A session, no new material

MGTSC 352 Lecture 9: Aggregate Planning Overview of Planning: Matching Demand and Capacity Case 2: Mountain Wear Leduc Control Example

Overview of Planning (pg. 46) Short-range Job assignment Machine loading Job sequencing Lot sizing Order quantities 02 mo. Intermediate Aggregate levels of: Workforce Inventory Output Subcontracting Backorders 18 mo. Long-range Product design Location Layout Capacity Process 5 yrs.?

Sequence of Planning (pg. 47) Corporate Strategy External Conditions Demand Forecasts Aggregate Plan Master Production Schedule MRP = Materials Requirements Planning Weekly Workforce + Customer Schedule Daily Schedule ManufacturingService

Matching Demand and Capacity Influencing demand ? Changing capacity ?

Matching Demand and Capacity (pg.48) Influencing demand Pricing Promotion Back orders New demand Changing capacity Hiring/firing Overtime/slack time Part-time workers Subcontracting Inventories

Case 2: Mountain Wear (pg. 96)

Case 2: Mountain Wear Decide … how much to produce how much inventory to carry how many people to hire or lay off how much overtime to use … in order to satisfy demand and minimize cost AGGREGATE PLANNING Let’s look at the first aggregate plan in the case … For next week: read case (pg. 96), fill in the blanks on pages in course pack

Leduc Control (pgs.52-53) The mysteries of solver unraveled … –… slowly How many units of each product to produce for the next period? –Simpler than Mountain Wear

Leduc Control Products: AS 1012 and HL 734 Production planning meeting: –Howie Jones (CEO) –Homer Simpson (Production) –Andy Marshall (Marketing) –Tania Tinoco (Accountant) –Kim Becalm (you)

Homer ResourceAS 1012HL 734Available PSoC11200 Assembly9 hrs.6 hrs.1,566 Programming12 hrs.16 hrs.2,880

Andy Can sell all we produce No room to raise prices

Tania ResourceAS 1012HL 734Unit Cost PSoC11$720 Assembly96$20 Programming1216$20 Var. cost / unit$1,140$1,160

More From Tania AS 1012HL 734 Selling price$1,490$1,460 Var. cost($1,140)($1,160) Net margin$350$300 Less: allocated fixed costs($310) Profit / unit$40($10) Tania’s conclusion: produce 200 AS 1012 and 0 HL 734 Do you agree?

Leduc Control Example (pg. 60) A linear problem –The “set cell” is linear function of changing cells –All constraints are linear functions of changing cells A linear function is one that involves –addition (or subtraction) –multiplication of a constant with a changing cell –no other operations –mathematically ax + by  linear function of two variables (x and y)

Linear vs. nonlinear If possible, use a linear formulation –Solver will work more reliably Convert Y/X ≤ 0.5 to Y ≤ 0.5X Quick-and-dirty approach: –Click “Assume Linear Model” and solve –If solver complains, unclick, try again

Leduc Control Example – Alternative Representations (pg. 61) Spreadsheet formulation (what we did in class) In English –Maximize net contribution –By varying the production levels of the two products –Subject to constraints: Use no more than 200 PSoCs Use no more than 1566 hours of assembly time Use no more than 2880 hours of programming (Do not produce negative units)

Algebraic Formulation

Matrix Formulation

Formulation in AMPL (= Algebraic Mathematical Programming Language) param NUM_RESOURCES; param NUM_PRODUCTS; set RESOURCES:=1..NUM_RESOURCES; set PRODUCTS:=1..NUM_PRODUCTS; param c {PRODUCTS} >= 0; # net margin per unit param A {RESOURCES, PRODUCTS} >= 0; # per-unit resource requirements param b {RESOURCS} >= 0; # resource availability var x {PRODUCTS} >=0; # number to make of each product # Objective: # Maximize the total net margin maximize total_net_margin: sum {i in PRODUCTS} c[i]*x[i]; # Constraints: # resource availability constraints subject to res_constr {j in RESOURCS}: sum{i in PRODUCTS} A[i,j] x[i] <= b[j];

Which Formulation is Best? Depends on what you want to do: –Understand the problem –Solve the problem Small problem Big problem –Communicate the problem –Develop a new/improved solver

Possible Solver Outcomes (pg. 63) Optimization Model Run Solver Optimal Solution Found Unbounded Problem  Infeasible Problem 

Unbounded Problem How will you know: What it means: –Possible to achieve infinite profit Either you will become filthy rich, or (more likely) there is something wrong with your model How to fix it: look for missing constraints

Infeasible Problem How will you know: What it means: –Impossible to satisfy all constraints Possible reasons: –You need more resources –You over-constrained the problem

Unbounded/Infeasible Problem Means solver cannot solve The values returned are meaningless –You need to look at your model

Is the plan still optimal? If not, how will it change? (pg. 65) 1.Howie realizes that he underestimated the net margin for each AS by $65. 2.Howie realizes that he overestimated the net margin for each AS by $65. 3.Howie discovers a new market where he can sell both AS and HLs at a 20% higher net margin than originally estimated.

More Post-Optimality Analysis 4.Another semiconductor supplier offers Howie 5 more PsoCs for a premium of $150 each (above and beyond the going rate of $720 per unit). Should Howie buy these PSoCs? 5.Howie sometimes helps out with programming the LCDs, thereby increasing the amount of available programming time. Should he help out in this cycle? If so, how long should he help out? 6.Howie’s nephew offers to work in assembly for a premium rate of $12 per hour (above and beyond the going rate of $20 per hour). Should Howie hire his nephew? For how many hours?

SolverTable (pg. 67) Combines Solver and Data Table Solves the problem repeatedly and reports all solutions Free add-in –see COURSE DOCUMENTS > RESOURCES > SOFTWARE on course web

Excel Solver Advantages (pg. 69) comes with Excel (no additional cost) has the same familiar user interface as other Excel components can solve problems with integer constraints and nonlinear problems can be automated using VBA

Excel Solver Disadvantages limited to 200 variables and 100 constraints (Premium: 800 variables, no limit on constraints) somewhat inconvenient (Ex: B12 + B13 ≤ B14 not allowed) can be slow when solving large problems with integer constraints (Premium Solver much faster) not very reliable (sometimes fails to find a solution) (Premium is more robust)

Other solvers Survey – $1, $10,000 Can solve very large problems (200,000 constraints) Usually require front-end modeling language Premium solver: $1,000