1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001.

Slides:



Advertisements
Similar presentations
Facility Location Decisions
Advertisements

Statistical Inventory control models I
Chapter 3 Network Planning.
Logistics Network Configuration
1 Chapter 15 Inventory Control  Inventory System Defined  Inventory Costs  Independent vs. Dependent Demand  Basic Fixed-Order Quantity Models  Basic.
Consumer Packaged Goods Manufacturing Industry Team: Aymaras Pan American Advanced Studies Institute Simulation and Optimization of Globalized Physical.
The Transportation and Assignment Problems
Economics 20 - Prof. Anderson1 Multiple Regression Analysis y =  0 +  1 x 1 +  2 x  k x k + u 2. Inference.
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results Mark S. Daskin, Collete R. Coullard and Zuo-Jun Max Shen presented.
EC Prof. Buckles1 Multiple Regression Analysis y =  0 +  1 x 1 +  2 x  k x k + u 2. Inference.
Chapter 5 Network Design in a Supply Chain
1 1 1-to-1 Distribution John H. Vande Vate Spring, 2001.
Network Models II Shortest Path Cross Docking Enhance Modeling Skills Modeling with AMPL Spring 03 Vande Vate.
1 1 Summary of First Section: Deterministic Analysis John H. Vande Vate Spring, 2007.
1 1 Transportation & Supply Chain Costs John H. Vande Vate Spring, 2001.
Design in the Supply Chain Spring, 2014 Supply Chain Management: Strategy, Planning, and Operation Chapter 5 Byung-Hyun Ha.
Slides 6 Distribution Strategies
Murat Kaya, Sabancı Üniversitesi 1 MS 401 Production and Service Systems Operations Spring Lot Sizing Slide Set #11.
1 Global Supply Chain Design John H. Vande Vate Spring 2005.
A Case Study: BuyPC.com Developed by Jim Morton; UPS Professional Services David Simchi-Levi; MIT Michael Watson; LogicTools, Inc. See also BuyPC.pdf.
Resource Allocation Class 7: 3/9/ W HY N ETWORK P LANNING ? Find the right balance between inventory, transportation and manufacturing costs, Match.
Location planning and analysis
1 1 Practice Final John H. Vande Vate Fall, 2002.
1 1 ISyE 6203 Consolidation Intro to GIS John H. Vande Vate Fall 2011.
The Interaction of Location and Inventory in Designing Distribution Systems Stephen J. Erlebacher and Russell D. Meller Presented By: Hakan Gultekin.
1 1 Modeling Inventory (Deterministic View) John H. Vande Vate Fall 2009.
Performance Mean 65. Solutions to Exam 2 zWe have a single commodity in warehouses around the country and wish to ship it to our customers at minimum.
1 1 ISyE 6203 Modeling Multi-DC version of Pooling John H. Vande Vate Spring 2012.
Since Pages 142 to 151 of the text are rather difficult to read, the following is a presentation of…
1 1 Solutions to Exam #1 John H. Vande Vate Fall, 2002.
1 1 Exam I John H. Vande Vate Spring, Question 1 … centers to minimize its total transportation costs from its 2 plants to its 5 markets. We.
1 1 Modeling Flows John H. Vande Vate Spring, 2006.
1 1 Modeling Inventory (Deterministic View) John H. Vande Vate Spring 2007.
Professor Goodchild Spring 08
Inventory and Models in Project 3 Load Driven Systems John H. Vande Vate Spring, 2001.
1 1 Transportation & Supply Chain Systems John H. Vande Vate Spring, 2001.
1 1 Review of Exam 1 John H. Vande Vate Fall 2009.
1 1 Review of Part I Preparation for Exam John H. Vande Vate Fall 2009.
Spring 02 Vande Vate 1 1 Modeling Service When Transport is restricted to Load-Driven Pool Points in Retail Distribution John Vande Vate Spring.
1 1 Transportation & Supply Chain Systems John H. Vande Vate Spring 2005.
Computationally speaking, we can partition problems into two categories. Easy Problems and Hard Problems We can say that easy problem ( or in some languages.
1 1 Exam 1 John H. Vande Vate Spring, Process 80+ exams to grade Certainly errors, misunderstanding, … Happy to re-grade BUT –Only respond to.
1 1 Practice Final John H. Vande Vate Fall, 2005.
3-1 Chapter 3: Network Planning CMB 8050 Matthew J. Liberatore.
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
1 1 ISyE 6203 Consolidation John H. Vande Vate Spring 2012.
1 1 Practice Exam #1 John H. Vande Vate Fall, 2002.
1 1 Modeling Inventory (Deterministic View) John H. Vande Vate Spring 2008.
Designing the Distribution Network in a Supply Chain
1 1 Frequency: Inventory vs Transportation John H. Vande Vate Spring, 2007.
The Transportation and Assignment Problems
Use More Soap Building Supply Chain Models Fixed Costs Aggregation
Chapter 5 Network Design in the Supply Chain
Managing Uncertainty with Inventory I
John H. Vande Vate Spring, 2005
Frequency John H. Vande Vate Fall,
John H. Vande Vate Spring, 2001
Many-to-Many Models Multicommodity Flows
Location Case Study Shanghai GM Service Parts Part II
Chapter 5 Network Design in the Supply Chain
Transportation & Supply Chain Costs: Answers to Questions
OUR COMPANY Group presentation 30th August 2011 A.Safari – J-P.Giraud
Best Practices Consortium
Modeling Service When Transport is restricted to Load-Driven
Demand Allocation Example
Logistics Systems Analysis Mid-Term Review
Project #1 Optimization Model
Modeling Flows and Information
John H. Vande Vate Spring, 2005
Presentation transcript:

1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001

2 2 Careful about Words... Plants can ship to –DCs (direct) or –The Warehouse (indirect) All combined shipments come from the warehouse (not the Indiana plant). All Monitors, TV’s and Keyboards are shipped via the warehouse.

3 3 Without Optimization For each DC there are 4 options: –All parts direct –All parts via Indianapolis warehouse –Green Bay & Indianapolis ship via warehouse –Denver & Indianapolis ship via warehouse Easy to calculate which of these is cheaper ….

4 4 But... Ignoring the inventory implications at the plants and warehouse for indirect shipments Why?

5 5 Not per DC

6 6 Inventory at the Warehouse

7 7 Approaches Inbound: Half a truckload for each plant that ships to the warehouse Outbound: ? The problem of different headways

8 8 Time How much does indirect shipment add to the time to market? Production Demand Production

9 9 Major weakness of Model It ignores the pipeline inventory This can have a significant impact on inventory!

10 EOQ How to calculate the optimal shipment size? Is the cost per unit: –Distance/Q + Interest Rate*Value or –Distance/Q + Interest Rate*Value/2?

11 It Depends! The EOQ formula –Inventory at the DC: Proportional to Q/2 –Transportation Cost: Proportional to Demand/Q –Inventory at the Plant: ?

12 Inventory at the Plant item-days inventory at the plant accumulated for each shipment to DC #1, say, if the shipment size is Q? Q 2 /(2*Production Rate) Q Q/Production Rate

13 Total Item-Days How many such shipments will there be? Annual Demand at DC #1/Q So, the total item-days per year from shipments to DC #1 will be… Q 2 /(2*Production Rate)*Demand at DC/Q Q*Demand at DC/(2*Production Rate) So, making shipments of size Q to DC #1 adds what to the average inventory at the plant?

14 Effect on Average Inventory Q*Demand at DC/(2*Production Rate) Example: Q*2500/(2*100*2500) = Q/200 Correct EOQ for Direct Shipments: Total Cost: carrying cost*Q*Demand at DC/(2*Production Rate) + carrying cost*Q/2 +transport cost*Demand at DC/Q Q* =  2*transport*Demand/carrying cost  P/(D+P)

15 In Our Case Since Demands at the n DCs are equal  P/(D+P) =  nD/(nD+D) =  n/(n+1) Q* =  2*transport*Demand/carrying cost  P/(D+P) Q* =  2*transport*Demand/carrying cost  n/(n+1)

16 Will this Work at the Warehouse? “Outbound” Inventory of monitors Consider shipments to a DC the gets CPU’s and Consoles direct from the plants -- shipping only Monitors, etc. from Warehouse Analysis is identical Q/2 * Q/P * D/Q = Q*D/(2*P) Half the shipment size How long to accumulate the shipment The number of shipments/year

17 What about the other products? Consider a shipment of Monitors and CPU’s What is the production rate? How long does it take to accumulate the shipment? Q Q/Production Rate

18 Assumption Q is the number of “assemblies” shipped Assembly is Monitor, Keyboard, TV and CPU How long does it take to accumulate the shipment? How long does it take to accumulate the assemblies? Assumption: Allocate Monitors etc. (which arrive faster) to assemblies at the rate the CPUs arrive and the remainder to pure shipments.

19 Example     

20 Can’t Model it Exactly “Outbound” inventory for part at Warehouse from shipments to DC EOQ/2 * EOQ/P * D/EOQ = EOQ*D/(2P) P = annual vol. of option thru warehouse 1 ship opt to dc via warehouse 0 otherwise P = sum{dc in DCs}Demand for option at DC* x[dc] In the denominator! That’s not linear { Binary variable x[dc] =

21 But, …. If all the EOQ*D’s are roughly equal we might approximate sum{dc in DCs} h * EOQ[dc]/2 *D*x[dc]/P sum{dc in DCs} h * EOQ[dc]/2 *(x[dc]/sum x[k])  h *(avg EOQ/2)*y Where y is a binary variable that models sum{dc in DCs} x[dc]/sum{k in DCs} x[k] 1 if any x[dc] =1 and 0 otherwise. { Binary variable y =

22 Without Optimization Ignore inventory at the plants and at the warehouse Calculate best strategy at each dc All Direct: $4.5 million Only Denver via Indianapolis: $4.1 million Only GB via Indianapolis: $3.5 million All via Indianapolis: $3.0 million Best at each DC: $3.0 million

23 Overview Sets –PLANTS –DCS –OPTIONS: All direct, none direct,... Parameters –Distances –EOQs for direct shipments and each option via the warehouse

24 Variables Select an option for each dc Whether or not each plant ships to the warehouse Optionally, indicate whether or not each plant serves each dc directly (can be inferred from the option chosen. Whether or not the warehouse shipped each option to some dc

25 Objective Transportation Costs Inventory Costs –Carrying cost for 1/2 the appropriate EOQ value at the DCs –1/2 the average EOQ value by option at the warehouse (outbound) –Carrying cost of 1/2 a truckload at the warehouse for each plant that ships to the warehouse (inbound)

26 Inventory at the Plants Shipments of size Q induce inventory of Q*Demand at Destination/(2*Production Rate) at the Plant Q is the –the EOQ for the DCs –a truckload for the warehouse sum{dc in DCs}EOQ[dc]/(2*100)*Did we ship direct? + sum{dc in DCs}TL/(2*weight*100)*Did we ship via warehouse?

27 Constraints Select a single option at each dc Whether or not each plant ships to the warehouse Whether or not the warehouse ships each option.

28 Reports To a manager, not a professor Executive Summary -- the business! Solution Details Appendix –Modeling Assumptions –Model Description –Model itself

29 Executive Summary Overview of Solution Take solution back through “exact” calculations and report –Total Cost –Breakdown of Transportation Cost Inventory Cost –Transportation Cost Breakdown by –Plant to Warehouse –Plant to DCs –Warehouse to DCs

30 Exec Summary Cont’d –Inventory (Volume, Value, Carrying Cost) Breakdown by –Plant –Warehouse »CPU »Monitor »Console –DCs (overall average, min and max) »CPU »Monitor »Console

31 Exec Summary - Impacts Time to market (total days in inventory) –Console –CPU –Monitors Days in Inventory at DCs (avg, min, max) –Console –CPU –Monitor Any significant regional differences..

32 What if... All via Indianapolis … Warehouses at other plants (above and beyond for class,…)...

33 Solution Details More detailed analysis of results summarized in Exec. Summary Charts, Tables, Graphs

34 Appendix Assumptions, Approximations, Observations How we handled Indianapolis vs. Warehouse Approach to Inventory at the Warehouse and at Plants EOQ further discussion...