Speaker Name: Robert Stawicki Speaker Title: Assistant Professor Ramapo College of NJ.

Slides:



Advertisements
Similar presentations
Inventory Control.
Advertisements

The Coin Game. SUPPLY CHAIN BASICS Key Learning Points: The dynamics of a supply chain The benefits to be gained from Supply Chain Visibility Demand/Supply.
Production and Inventory Management
Production and Inventory Management
Introduction to LP Modeling
A Multiperiod Production Problem
Facility Location Decisions
1.224J: Recitation #1 Linear programming Modeling and solution in Excel.
Applications of Optimization To Operations Management
Computational Methods for Management and Economics Carla Gomes Module 2 (addendum) Revisiting the Divisibility Assumption (Textbook – Hillier and Lieberman)
Role of Inventory in the Supply Chain
Statistical Inventory control models I
An Application of Linear Programming Lesson 12 The Transportation Model.
Graduate Program in Business Information Systems Inventory Decisions with Uncertain Factors Aslı Sencer.
Capacity Planning. How much long-range capacity is needed When more capacity is needed Where facilities should be located (location) How facilities should.
PRODUCTION AND OPERATIONS MANAGEMENT
Capacity Planning For Products and Services
Capacity and Constraint Management
Copyright © Cengage Learning. All rights reserved. OPTIMIZING LOT SIZE AND HARVEST SIZE 3.5.
Cours GOL 460 Chaînes logistiques et d´approvisionnement
No Backlogging Problem # 1(pg.104) October 20,2011
Thank you and welcome Linear Programming (LP) Modeling Application in manufacturing And marketing By M. Dadfar, PhD.
Chapter 12: Inventory Control
Transportation Problem
Transportation simplex method. B1B2B3B4 R R R Balanced?
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Transshipment Problem
Logistics Network Configuration
Linear Programming Models & Case Studies
B-1 Operations Management Linear Programming Module B - New Formulations.
Inventory Control IME 451, Lecture 3.
Chapter 9 Inventory Management.
© J. Christopher Beck Lecture 27: Supply Chain Scheduling 1.
Chapter 8 Aggregate Planning in a Supply Chain
PROFESSOR GOODCHILD CEE 587 APRIL 15, 2009 Basic Optimization.
Example 6.2 Fixed-Cost Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Great Threads Company is capable of manufacturing.
B-1 Operations Management Linear Programming Module B - Harder Formulations.
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results Mark S. Daskin, Collete R. Coullard and Zuo-Jun Max Shen presented.
INTRODUCTION TO LINEAR PROGRAMMING
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Linear Programming Applications
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
Integer Programming Models
OPERATIONS RESEARCH Linear Programming Problem (SOLVED PROBLEM)
Inventory Management and Risk Pooling (1)
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
DISTRIBUTION AND NETWORK MODELS (1/2)
MGTSC 352 Lecture 14: Aggregate Planning WestPlast Case H ow to deal with multiple objectives How to use binary variables AltaMetal Case Aggregating into.
1 System Planning 2013 Lecture 7: Optimization Appendix A Contents: –General about optimization –Formulating optimization problems –Linear Programming.
Supply Chain 1. 2 What is Global Supply Chain A Supply chain that transforms a group of ad hoc and often fragmented processes, from a variety of globally.
In some cases, the waste generated by the production of material at a facility must be disposed of at special waste disposal locations. We need to identify.
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.
Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,
Linear Programing Problem
A Multiperiod Production Problem
Problem 1 Demand Total There are 20 full time employees, each can produce 10.
Introduction to Linear Programs
LOGISTICS NETWORK.
Chapter 8 Aggregate Planning in the Supply Chain
Chapter 8 Aggregate Planning in the Supply Chain
Chapter 12 Determining the Optimal Level of Product Availability
1.3 Modeling with exponentially many constr.
Chapter 8 Aggregate Planning in the Supply Chain
GEOP 4355 Distribution Problems
Supply Chain Management (3rd Edition)
Managing Economies of Scale in a Supply Chain Cycle Inventory
1.3 Modeling with exponentially many constr.
Business Logistics Management
Presentation transcript:

Speaker Name: Robert Stawicki Speaker Title: Assistant Professor Ramapo College of NJ

Background Based on 20 Years Experience Implementing Supply Chain Models for Fortune 100 Companies Formulating Models from Scratch Or Models Provided by Major Supply Chain Solutions Vendors

Outline LP Formulation for Supply Chain Optimization Six Common Pitfalls and Their Work Arounds – Using Full Costing – Time Frame Too Short – Production Levelling – Inventory being “Reborn” (Product Aging Constraints) – Honoring Safety Stocks while Stocking Out Customers – Starting Inventory is “Free”

Basic Formulation Minimize Total Cost Production Cost Inventory Carrying Cost Intra-Company Transportation Cost Transportation Cost to Customers Stock Out Costs Safety Stock Violation Cost Subject To: Material Balance Constraints Capacity Constraints Satisfy Demand Constraints Satisfy Safety Stock Constraints

Basic Formulation (Continued) To Discuss:  Maximize vs. Minimize  Stockout vs. Backorder  Other Constraints  Model Size  See Appendix

Using Full Costing Plant A Fixed Cost $2.00 Variable Cost / Unit $5.00 Total Cost / Unit$7.00 Plant B Fixed Cost $0.50 Variable Cost / Unit $6.00 Total Cost / Unit$6.50 Assume Demand = 10,000 units All Other Costs Equal

Using Full Costing (continued) Full Costing Based Model Plant B Produces all 10,000 Units Plant A Fixed Cost $20,000 Variable Cost 0 Total Cost $20,000 Plant B Fixed Cost $5,000 Variable Cost 60,000 Total Cost $65,000 Total Cost $85,000 Marginal Cost Based Model Plant A Produces all 10,000 Units Plant A Fixed Cost $20,000 Variable Cost 50,000 Total Cost $70,000 Plant B Fixed Cost $5,000 Variable Cost 0 Total Cost $5,000 Total Cost $75,000 ___________________________________________________________________________________________________________________________________________________________________________________

Time Frame Too Short ___________________________________________________________________________________________________________________________________________________________________________________

Loosely defined: “Minimize the change in production level from period to period.” Production Levelling A typical method is to add the following to the objective function: And the following set of constraints : Where: LEVELCOST = A large penaltyL +, L - = Change in Production Level

The problem with this formulation is LP sees no difference between several small changes and one large one. It may actually prefer the large one as shown below. Production Levelling ( Continued )

A better formulation: Production Levelling ( Continued ) Instead of the previous change, add the following to the objective function: Notice only one variable per location for all time periods: In addition to the previous set of constraints, add the following two sets of constraints:

For the same demand pattern, the change in production level from period to period is much smaller. Production Levelling ( Continued ) Note: A similar approach works well for minimizing the change in other variables across multiple time periods.

Loosely defined as, “Product must be <= k periods old.” Inventory Being Reborn Typically modeled as: Problem: LP will use the T p,l,l’,t variables to bypass this constraint by moving inventory between locations. ( see example next slide )

Assume: Production Capacity at Locations 1&2 = 1 unit/period. k=2 Inventory Being Reborn (continued) Inventory is Re-bornI

Solutions: Inventory Being Reborn (continued) Easiest - Eliminate the T p,l,l’,t variables. To discuss: “execution” vs. “planning” Harder - Add an additional time based domain to most of the variables and inventory balance rows. This is beyond the scope of this presentation.

Honoring Safety Stocks Over Customers Min Z = Safety Stock Constraint: Refresher: Standard Practice: SOCOST = M SVCOST = 0.5*M Where: SO= Stockout AmountSV= Safety Stock Violation Amount

Honoring Safety Stocks Over Customers Scenario

Honoring Safety Stocks Over Customers Honor Safety Stock Note: There is an alternate solution with the same total penalty cost in which you ship 10 in Period 3.

Honoring Safety Stocks Over Customers Satisfy Customer Demand over Safety Stock

Honoring Safety Stocks Over Customers Solution

Honoring Safety Stocks Over Customers Solution Maintain Safety Stock

Honoring Safety Stocks Over Customers Solution Satisfy Customers

Starting Inventory is “Free” Objective function does not account for inventory consumption LP may ship to inappropriate locations Reporting Issues

Starting Inventory is “Free” P= $10 T= $15 P= $15 T= $10 Plant B Plant A No issue if inventory is consumed elsewhere during the model horizon.

Starting Inventory is “Free” Solution Add to the objective function: Add a new set of constraints: Note: Easily modified if you wish to capture increases in inventory as well.

Questions?

Thank you!

Appendix

Basic Formulation Where: PRO = Set of All Products MAC = Set of All Machines LOC = Set of All Locations TIM = Set of All Time Periods CUS = Set of All Customers PCOST= Cost to Produce ICOST = Cost to Hold Inventory TCOST = Inter LOC Transportation Cost SOCOST = Stockout Cost TCCOST = LOC to CUS Transportation Cost SVCOST = Safety Stock Violation Cost P = Amount to Produce I = Inventory at the END of the Period T = Amount to Move Between LOC’s TC = Amount to Move Between LOC– CUS SO = Demand not Fulfilled SV = Amount of Safety Stock Violation K = Capacity SS = Safety Stock D = Demand

Basic Formulation (Continued) Subject To: Capacity Constraint: Safety Stock: Material Balance: Demand:

Model Size Variables:  P – 100 * 5* 10 * 52 = 260,000  I – 100 * 10 * 52 = 52,000  T – 100 * 10 * 9 * 52 =468,000  TC – 100 * 3 * 100 *52 = 1,560,000  SO = 100 * 100 * 52 = 520,000  SV = 100 * 10 *52 52,000 Total 2,912,000 Assumptions:  10 Plants  5 Machines / Plant  100 Products  100 Customers (Assume 3 Plants/Customer)  52 Periods

Model Size (continued) Note: Real Models tend to be smaller because not every combination exists. Constraints:  Capacity – 10 * 5* 52 = 2,000  Balance – 100 * 10 * 52= 52,000  Demand – 100 * 100 * 52=520,000  Safety Stock * 10 * 52 = 52,000 Total 574,000