Simulation as a Method for Determining Inventory Classifications for allocation

Companies that utilize multiple facilities to satisfy customer demand are faced with the same basic question - where should inventory be held? This thesis presents a method for answering this question, specifically for a company that allocates multiple units across multiple facilities, where any facility can fulfill an order to any customer, though with differing shipping costs. The model presented is a simulation of the shipping costs of various allocation strategies across a range of allocated inventory quantities, where the strategies simulated include consolidating all inventory in a central facility, constraining inventory to regional hubs, and spreading inventory throughout the network. The simulated results are then compared to find the low cost allocation strategy at a given level of allocated inventory. With this comparison, product groupings with the same low cost allocation strategy are identified, and are defined as "Slow", "Medium-A", "Medium-B", and "Fast" products. These groups can then be used to manage the allocation process, where "Slow" inventory is held centrally, "Medium-A" inventory held regionally, and "Fast" inventory spread throughout the network. "Medium-B" items serve as a costmitigating flexible option, where they are spread throughout the network when possible but consolidated when necessary to avoid changing the allocation for "Fast" items. At a broad level, the model presented is applicable to any company that can fulfill demand to a single customer from multiple facilities.

Department dc:contributor.department

Leaders for Global Operations Program at MIT

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2012

Author dc:creator

• Ball, Braden (Braden R.)

Advisor dc:contributor.advisor

• Stephen Graves and Chris Caplice.

• Sloan School of Management.
• Engineering Systems Division.
• Leaders for Global Operations Program.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/73378

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/73378