Massachusetts Institute of Technology
Using K-means clustering to create cost and demand functions that decrease excess inventory and better manage inventory in defense
Abstract
dc:description.abstractExcess inventory is prevalent in both the armed forces and defense companies; it takes up space and resources that could be used elsewhere. This thesis proposes a method to reduce the excess inventory and associated costs, while maintaining instant part availability, despite design changes which alter the number of parts required. A single period model extension was created based on K-means clustering of the parts according to lead-time and cost. These groupings provided the backbone of the cost functions created in the thesis. A predictive demand function was also created so that the design change's alterations to demand would be captured. The cost function was optimized using the predicted demand, to find an optimal order quantity that met the demand requirements and was the lowest cost option. Together these single period model function extensions allowed for a 31 percent decrease in excess inventory and 34 percent decrease in total cost. Due to the nature of this report the companies' names have been removed, and the data naming conventions were altered so as to protect the nature of the parts.
Degree
thesis:*- Department dc:contributor.department
- Massachusetts Institute of Technology. Supply Chain Management Program.
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 2018
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Porter, Danaka M. (Danaka Michele)
- Advisor dc:contributor.advisor
-
- Sergio Caballero.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/117798
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/117798