A multi-echelon supply chain model for strategic inventory assessment through the deployment of kanbans

As global competition in the manufacturing space grows, so do corporations' needs for sophisticated and optimized management systems to enable continuous flows of information and materials across the many tiers within their supply chains. With the complexities introduced by the variability in the demand for finished goods as well as by the variability in lead-time of transportation, procurement, production and administrative activities, corporations have turned to quantitative modeling of their supply chains to address these issues. Based on the data of a heavy machinery manufacturer headquartered in the US, this research introduces a robust model for the deployment of strategic inventory buffers across a multi-echelon manufacturing system. Specifically, this study establishes a replenishment policy for inventory using a multiple bin, or Kanban, system for each part number in the assembly of products from our sponsors tractor line. We employ a numerical simulation to evaluate and optimize the various inventory deployment scenarios. Utilizing several thousand runs of the simulation, we derive a generalized treatment for each part number based on an econometric function of the parameters associated with lead-time, order frequency, inventory value and order costing. The pilot for the simulation focuses on the parts data for three earthmoving products across eight echelons, but scales to n products across m echelons. Our results show that this approach predicted the optimal quantities of Kanbans for 95% of parts to a level of accuracy +/- 3 bins.

Department dc:contributor.department

Massachusetts Institute of Technology. Engineering Systems Division.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2008

Authors dc:creator

• Hodge, Philip J. (Philip James)
• Lemaitre, Joshua D

Advisor dc:contributor.advisor

• Stephen C. Graves.

• Engineering Systems Division.

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/45228

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/45228