Lecture 17: Network Models/ Inventory Problems AGEC 352 Spring 2011 – March 28 R. Keeney.

Slides:



Advertisements
Similar presentations
Production and Inventory Management
Advertisements

Logistics & Channel Management
Chapter 3: Linear Programming Modeling Applications © 2007 Pearson Education.
Transportation Problem (TP) and Assignment Problem (AP)
Lecture 13: Transportation ‘Autopower Co. Case’ AGEC 352 Spring 2011 – March 9 R. Keeney.
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)
PRODUCTION AND OPERATIONS MANAGEMENT
Operations Management
Aggregate Planning.
Agribusiness Management
Introduction to Operations Research
Chapter 4: Linear Programming Presented by Paul Moore.
Lecture 15: Transportation and other Networks AGEC 352 Spring 2012 – March 21 R. Keeney.
1 Introduction to Operations Management Aggregate Planning CHAPTE R 12.
Linear Programming Using the Excel Solver
Chapter 8 Aggregate Planning in a Supply Chain
Session 2b. Decision Models -- Prof. Juran2 Overview More Sensitivity Analysis –Solver Sensitivity Report More Malcolm Multi-period Models –Distillery.
Example 14.3 Football Production at the Pigskin Company
Lecture 7: Linear Programming in Excel AGEC 352 Spring 2011 – February 9, 2011 R. Keeney.
Lecture 15: Transportation and other Networks AGEC 352 Spring 2011 – March 23 R. Keeney.
Lecture 12: Transportation Introduction AGEC 352 Spring 2011 – March 7 R. Keeney.
Lecture 11: Sensitivity Part II: Prices AGEC 352 Spring 2011 – March 2 R. Keeney.
Lecture 1: Basics of Math and Economics AGEC 352 Spring 2011 – January 12 R. Keeney.
Logistics Cost Part II Professor Goodchild Spring 11.
Computational Methods for Management and Economics Carla Gomes
Aggregate planning 1 Aggregate planning / scheduling Medium range plan - what we will make over the next 3-18 months. –general demand –controllable variables.
Supply Chain Operations: Making and Delivering
Linear Programming Applications
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Transportation Model (Powerco) Send electric power from power plants to cities where power is needed at minimum cost Transportation between supply and.
Production planning and control is the organization and planning of the manufacturing process. It co-ordinates supply and movement of materials and labor,
LINEAR PROGRAMMING SIMPLEX METHOD.
MATRICES AND DETERMINANTS
Network Models II Shortest Path Cross Docking Enhance Modeling Skills Modeling with AMPL Spring 03 Vande Vate.
TRANSPORTATION MANAGEMENT
Lecture 6: Algorithm Approach to LP Soln AGEC 352 Fall 2012 – Sep 12 R. Keeney.
MODULE -7 IT IN THE SUPPLY CHAIN
The Supply Chain Customer Supplier Manufacturer Distributor
Lecture #9. Review Homework Set #7 Continue Production Economic Theory: product-product case.
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to two  constraints.
November 5, 2012 AGEC 352-R. Keeney.  Recall  With 2000 total units (maximum) at harbor and 2000 units (minimum) demanded at assembly plants it is not.
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.
Inventory Management FIN 340 Prof. David S. Allen Northern Arizona University.
Aggregate Planning Chapter 13. MGMT 326 Foundations of Operations Introduction Strategy Managing Projects Quality Assurance Facilities & Work Design Products.
Lecture 3: Introductory Spreadsheet Modeling AGEC 352 Spring 2012 – January 23 R. Keeney.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 7 LP Formulation Examples.
© J. Christopher Beck Lecture 25: Workforce Scheduling 3.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Algebra 2 4.2, 4.3a Machhapuchhare SAT Question: When it is 7:00 am in Seattle, it is 10:00 am in Philadelphia. A plane is scheduled to leave Philadelphia.
1 1 Modeling Flows John H. Vande Vate Spring, 2006.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
PowerPoint presentation to accompany Chopra and Meindl Supply Chain Management, 5e 1-1 Copyright ©2013 Pearson Education, Inc. publishing as Prentice Hall.
Lecture 13: Transportation Introduction AGEC 352 Spring 2012 – March 5 R. Keeney.
1 Chapter 16 Relevant Costs and Benefits for Decision Making.
Rough-Cut Capacity Planning in SCM EIN 5346 Logistics Engineering Fall, 2015.
Rough-Cut Capacity Planning in SCM Theories & Concepts
Lecture 13: Transportation Introduction AGEC 352 Fall 2012 – October 24 R. Keeney.
SALES AND OPERATIONS PLANNING AGGREGATE PLANNING PRODUCTION PLANNING OPERATIONS PLANNING How to meet effectively and efficiently forecasted requirements.
Linear Programming Models: Graphical and Computer Methods
Rough-Cut Capacity Planning in SCM Theories & Concepts
Aggregate Planning Chapter 13.
Location Case Study Shanghai GM Service Parts Part II
The assignment problem
Routing and Logistics with TransCAD
TransCAD Vehicle Routing 2018/11/29.
ISyE 6203 The HDT Case Vande Vate Fall,
Routing and Logistics with TransCAD
Let’s Talk about Agricultural Marketing
Presentation transcript:

Lecture 17: Network Models/ Inventory Problems AGEC 352 Spring 2011 – March 28 R. Keeney

Dynamic Modeling *Static Model—Limited to a single time period ◦ What crops to raise for profits  Field preparation, sowing seed, fertilization, chemical treatment etc. *Dynamic Model—Multiple period model ◦ Decisions are dependent on prior decisions and on future opportunities  Field preparation (when?)  Sowing seed (can’t be completed until field prep)  Fertilization (how much and when?)  Chemical treatment (how much and when?)  Growing season  Harvest  Marketing ◦ Dynamics add a heavy dose of realism to economic models

Dynamics The realism of dynamic models comes at a heavy price ◦ Dynamic relationships can be conceptually difficult and hard to sort out  The order of operations needs to be explicit as well as options on the order of operations Model dimension (size) can quickly become very large for even a simple model ◦ Think of airline scheduling  Want plane capacities to match demand by travelers  Also want planes that arrive at destinations to be the right ones to take the next travelers  Want to do all that in a cost efficient manner

Inventory Example Production and Inventory Management Minimize total costs of production and holding inventory Model constraints: ◦ Monthly production capacity ◦ Non-negative inventory  You can’t deliver product in advance of producing it ◦ Supply in each month  Production plus carried over inventory  Production must also be non-negative

Why is this dynamic? The inventory handling makes this problem dynamic ◦ Excess production from one month is carried over and can cause you to lower production in the next month ◦ I.e. the decisions you made last month impact options you have this month Long run scheduling should take this into account ◦ If I choose A in period t, I am left with X options in period t + 1 ◦ Modeling ensures you are not eliminating profitable later period options by choices today

Algebraic Model Let I(t) be the inventory at time t ◦ I(0) is initial inventory (1 st day of month 1) ◦ I(1) inventory after 1 st month  Last day of month 1  First day of month 2 ◦ I(2) inventory after 2 nd month  Last day of month 2  First day of month 3

Algebra: Changes to Inventory The production and delivery (demand) for each month are combined with initial inventory to determine the new end of month inventory Let x(t) be production in month (t) Let d(t) be deliveries in month (t) Then ◦ I(t) = I(t-1) + x(t) – d(t) ◦ Two periods linked in one equation

Periods linked w/ Balance Eqn Works just like balance equations from previous models ◦ E.g. supply of corn in bushels cannot exceed use of bushels of corn ◦ Transport waypoint balance equations (ship no more than is received) Sources of product ◦ Current production or carried over inventory Uses of product (sinks) ◦ Deliveries or placement in inventory

Balance Equation Supply = Demand I(t-1) + x(t) = I(t) + d(t) This balance equation is different because it is intertemporal We talked about different properties of goods/commodities ◦ Form (convert labor to food) ◦ Location (move a motor to Le Havre) ◦ Time (move product to next month)

Full Algebraic Model

Building the Model in Excel Use our basic Network/Transport model framework to set this up Sources = production in a month ◦ Inventory carry-over adds to this Destinations = sales in a month ◦ New inventory adds to this

Excel Model Unit Costs ◦ Cost of production for each month of production and month of sale ◦ Cost of producing in Jan with delivery in  Jan  Feb  March  April ◦ Cost of production includes the carrying cost (inventory holding cost)

Modeling Issue In our decision variable matrix we have some issues ◦ You can’t produce in February and deliver in January Options (recall the unavailable routes) ◦ Constrain the decision variables to zero ◦ Set really high cost coefficient ◦ Omit the decision variables that are impossible

Constraints Sum over rows to account for production capacity constraints Sum over the columns to account for demand requirements Final period (no production) but there is a demand requirement for May ◦ Some inventory required at the end of the planning period (company is not going out of business)