Prepared By: Maxine Cunningham John Schmidt Jonathan Braams 4/4/2009 Production Facility Optimization.

Slides:



Advertisements
Similar presentations
Welcome Charlottesville, VA P&DF Area Mail Processing (AMP) Study November 18, 2009.
Advertisements

Welcome Staten Island, NY P&DF Area Mail Processing (AMP) Study April 29, 2009.
Welcome Oxnard, CA P&DF Area Mail Processing (AMP) Study August 5, 2009.
Welcome Panama City, FL P&DF Area Mail Processing (AMP) Study January 14, 2010.
WAREHOUSING MANAGEMENT
WAREHOUSING MANAGEMENT
Real Travel Savings with Virtual Meetings 1 Jeremy Stubbs General Manager, Sabre Virtual Meetings.
Logistics Network Configuration
ArcLogistics Routing Software for Special Needs, Maintenance and Delivery.
Logistic Management Warehousing
Outside Spend Team - Update to the Staff Advisory Council August 14,
Supply Chain Location Decisions Chapter 11 Copyright ©2013 Pearson Education, Inc. publishing as Prentice Hall
Linear Programming Using the Excel Solver
© 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang 4-1 Decision Trees and Tables; LP Modeling.
ISEN 601 Location Logistics Dr. Gary M. Gaukler Fall 2011.
Chapter 15 Application of Computer Simulation and Modeling.
Software Applications in Supply Chain Management Project Management and Implementation Implications Guest Lecture - February 26, 2002 Dominic Noce
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Three Classic Applications of LP Product Mix at Ponderosa Industrial –Considered limited.
The Transportation and Assignment Problems
© C.Hicks, University of Newcastle IGLS02/1 A Genetic Algorithm Tool for Designing Manufacturing Facilities in the Capital Goods Industry Dr Christian.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
QM B Linear Programming
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
© C.Hicks, University of Newcastle C.F.Earl, Open University IDMME02/1 A Genetic Algorithm Tool for Designing Manufacturing Facilities in the Capital Goods.
Velocity.
Simon Bunn – Derceto Inc
1 Supply Chain Decision Support Systems ISyE3103.
Spatial Statistics UP206A: Introduction to GIS. Central Feature.
Network and Dynamic Segmentation Chapter 16. Introduction A network consists of connected linear features. Dynamic segmentation is a data model that is.
Impromptu Data Extraction and Analysis Data Mining and Analytics Framework for VLSI Designs Sandeep P
Deploying Electronic Tolls by David Levinson and Elva Chang.
2006 Palisade User ConferenceNovember 14 th, 2006 Inventory Optimization of Seasonal Products with.
Traffic Assignment Convergence and its Effects on Selecting Network Improvements By Chris Blaschuk, City of Calgary and JD Hunt, University of Calgary.
Introduction to Spreadsheet Modeling
Content-Based Music Information Retrieval in Wireless Ad-hoc Networks.
Chapter 4 Linear Regression 1. Introduction Managerial decisions are often based on the relationship between two or more variables. For example, after.
Steven Owen Nicole Robinson Nina Trujillo. Background/Problem Coca-Cola Bottling Company of North Texas Inefficient Forecasting Model  Simple linear.
WORK ZONE DELAY ESTIMATION Work Zone Management, Accelerated Construction, and Smart Work Zones TEAM Monthly Meeting November 16, 2004 Luis Porrello, Ph.D.,
Flow Planner Presentation Selected Case Studies. Internet / Intranet based Process Engineering Flow Planner Features Analyze an unlimited number of flow.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 7 Business Analytics with Shipment Models Business Analytics with Management.
3 Characteristics of an Optimization Problem General descriptionKPiller Illustration Decisions that must be made; represented by decision variables How.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
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.
Intelligent Supply Chain Management Strategic Supply Chain Management
Velocity is a vector quantity therefore must include direction.
Welcome Lima, OH P&DF Area Mail Processing (AMP) Study January 6, 2010.
Gulay Litchfield For CQI-TECH PLC
Sonic Speakers Facility Design Chris Chesla Dan Hovde Tony Niemczyk Mike Rosenthal.
S8P3. Students will investigate relationship between force, mass and the motion of objects.
Management Science 461 Lecture 3 – Covering Models September 23, 2008.
1 1 DISTRIBUTION EFFICIENCY INITIATIVE (DEI) Benefits on Both Sides of the Meter RTF MEETING February 5, 2008.
Optimizing Hydrogen Pipeline Deployment in Real Geographic Regions Nils Johnson Joan Ogden Yueyue Fan National Hydrogen Association Conference May 4, 2010.
© 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
The Transportation and Assignment Problems
Disabled Adult Transit Service:
John H. Vande Vate Spring, 2001
Cellular Layouts Cellular Production Group Technology
Industrial Assessment Center Database
8.2 Average Velocity.
Capacity Planning.
MEASURING INDIVIDUALS’ TRAVEL BEHAVIOUR BY USE OF A GPS-BASED SMARTPHONE APPLICATION IN DAR ES SALAAM CITY 37th Annual Southern African Transport Conference.
1.206J/16.77J/ESD.215J Airline Schedule Planning
Location Problems John H. Vande Vate Fall,
A more complex LP problem with What’sBest!
Option Valuation for National Retailer
A more complex LP problem
Chapter 9: Introduction to JADE Case Study
Optimization of Retention Rates of Ready Mix Drivers
Inventory Fundamentals
Presentation transcript:

Prepared By: Maxine Cunningham John Schmidt Jonathan Braams 4/4/2009 Production Facility Optimization

Model Design Introduction Methodology Analysis Conclusion Executive Summary Problem Summary: Currently operating 4 production facilities Looking to relocate one plant Model Building: Replicate current layout Build functionality to “open or close” facilities Interface Design: Easy manipulation of the model Simple to interpret Dynamic and updateable Recommendation: Relocation of Leduc plant to south Edmonton Over $120,000 reduction in annual delivery costs Move from a 4 plant to a 3 plant system Millions of dollars saved annually

Model Design Introduction Methodology Analysis Conclusion Current Layout: Leduc Strathcona 2 west Edmonton Key Questions: 1.Operate in current state or relocate Leduc? 2.If so, where? 3.Other efficiency recommendations? Problem `

Model Design Introduction Methodology Analysis Conclusion 1 ) Determining Demand Locations Question of Concern Considering the client’s demand dispersion, how should we go about splitting up the demand appropriately? Answer Mimicked client’s approach to splitting up demand into 159 locations.

Model Design Introduction Methodology Analysis Conclusion Determining Demand Locations

Model Design Introduction Methodology Analysis Conclusion 2) Candidate Location Selection Question of Concern What variables need to be considered when choosing potential candidate locations for our client?

Model Design Introduction Methodology Analysis Conclusion Candidate Location Selection 1)Current Layout-West End Plant (2), Sherwood Park (1), Leduc Plant (1)

Model Design Introduction Methodology Analysis Conclusion Candidate Location Selection 2) Medium Industrial Constraint

Model Design Introduction Methodology Analysis Conclusion Candidate Location Selection 3) Qualitative Considerations- Future Growth

Model Design Introduction Methodology Analysis Conclusion Answer: 16 Candidate Locations (Southern Area) Candidate Location Selection

Model Design Introduction Methodology Analysis Conclusion 3) Distance Calculation Question of Concern How do you maximize distribution efficiency? Answer By Decreasing the distances travelled Goal To take our 16 Candidate plant locations and our 4 current plant locations (20 plant locations) and determine the distances from each plant location to all the 159 demand locations.

Model Design Introduction Methodology Analysis Conclusion Distance Calculation Step 1: Midpoint Calculation

Model Design Introduction Methodology Analysis Conclusion Step 2 : Plot potential and current plant locations Distance Calculation

Model Design Introduction Methodology Analysis Conclusion Step 3 : Calculate Distance between each plant and all demand points 159 X 20= 3,180 Distance Calculation

Model Design Introduction Methodology Analysis Conclusion Distance Calculation

Model Design Introduction Methodology Analysis Conclusion Abs(X 2 – X 1 ) (X 2,Y 2 ) (X 1,Y 1 ) Abs(Y 2 – Y 1 ) Rectilinear Distance Calculation Rectilinear Distance Calculation to Km’s Distance Calculation s=1: Rectilinear metric

Model Design Introduction Methodology Analysis Conclusion 4) Distance-Time Conversion Question of Concern Given distances how do you accurately calculate time? Answer By using data and linear approximation Goal To convert all distances (km) to time in order to apply costs. (Clients costs are given per hour)

Model Design Introduction Methodology Analysis Conclusion Time (min) Distance (km) Step 1: Plot Time vs. Distance with actual client data ( No significant correlation) Distance-Time Conversion

Model Design Introduction Methodology Analysis Conclusion Time (min) Distance (km) Step 1: Plot Time vs. Distance with actual client data ? ? ? ? Distance-Time Conversion

Model Design Introduction Methodology Analysis Conclusion Time (min) Distance (km) Time (min) Distance (km) “Outside City Travel” “Within City Travel” Step 2: Split data into two groups : “within city travel” & “outside city travel” Distance-Time Conversion

Model Design Introduction Methodology Analysis Conclusion Time (min) Distance (km) Time (min) Distance (km) “Outside City Travel” “Within City Travel” Step 2: Split data into two groups : “within city travel” & “outside city travel” Distance-Time Conversion

Model Design Introduction Methodology Analysis Conclusion Time (min) Distance (km) Time (min) Distance (km) “Outside City Travel” “Within City Travel” Step 3: Calculate Coefficient/ Speed for each group y = βx + ε β = 64 km/h y = βx + ε β = 45 km/h Distance-Time Conversion

Model Design Introduction Methodology Analysis Conclusion Step 4: Multiply each coefficient by each and every distance to obtain time Distances (km) Time (min) ÷ (speed) Example WCT  14 km (distance) ÷ 45km /h (coefficient) =.31 hours (19 min) OCT  36 km (distance) ÷ 64km /h (coefficient) =.56 hours (34 min) Distance-Time Conversion

Model Design Introduction Methodology Analysis Conclusion Mission Impossible The Brilliant Spreadsheet The Beautiful Model

Model Design Introduction Methodology Analysis Conclusion The Complex Communication Binary cell activates (turning on a plant) Time Minimization performed Colors and transparency assigned to each demand location Interface retrieves demand, utilization, and cost information User clicks a candidate location 01

Model Design Introduction Methodology Analysis Conclusion Model Demonstration

Model Design Introduction Methodology Analysis Conclusion Model Demonstration

Model Design Introduction Methodology Analysis Conclusion Model Demonstration

Model Design Introduction Methodology Analysis Conclusion Current Plant Mix

Model Design Introduction Methodology Analysis Conclusion Turn off Leduc – Inefficient Plant

Model Design Introduction Methodology Analysis Conclusion Optimal 4-Plant Mix

Model Design Introduction Methodology Analysis Conclusion Turn off Inefficient Plant

Model Design Introduction Methodology Analysis Conclusion Data Selection

Model Design Introduction Methodology Analysis Conclusion Industrial Zones

Model Design Introduction Methodology Analysis Conclusion Planned Neighbourhoods

Model Design Introduction Methodology Analysis Conclusion Truck Routes

Model Design Introduction Methodology Analysis Conclusion Total Transportation Costs Current Costs

Model Design Introduction Methodology Analysis Conclusion Total Transportation Costs Annual Savings $128,000 +

Model Design Introduction Methodology Analysis Conclusion Benefits Provided with a dynamic and updateable decision making tool Over $128,000 in annual delivery cost savings Over $1.7 Million discounted savings in perpetuity Significant operation costs reductions; moving from 4 to 3 plants Quicker delivery times to south Edmonton Happy Customers / Happy Client

Model Design Introduction Methodology Analysis Conclusion Close Leduc and Acheson plants Open new facility in candidate location four “CL4” Annual delivery cost savings of over $128,000 Immense operational cost savings from reducing plants

Model Design Introduction Methodology Analysis Conclusion Questions?