Thesis (S.M.)--Massachusetts Institute of Technology, Engineering Systems Division, 2005. / Includes bibliographical references (leaves 88-92). / Within the semiconductor industry, the variability in both supply and demand is quite high; this uncertainty makes supply chain planning very difficult. We analyze the current tools and processes at a large semiconductor manufacturing company and then propose a framework for improvement based on hierarchical production planning. We present an appropriate decomposition for this specific planning problem and illustrate some limitations of traditional inventory models. New safety stock equations are developed for this planning problem based on a simple analysis using the basic ideas from probability theory. We also devise a new method to determine lead times that more accurately captures the actual lead time seen in the supply chain. Finally, an algorithm is developed to determine appropriate inventory levels and production allocation. These ideas, when used together, provide a powerful framework to properly manage supply chains in highly stochastic environments. / by Jeffrey D. Johnson. / S.M.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/28926 |
| Date | January 2005 |
| Creators | Johnson, Jeffrey D. (Jeffrey David), 1979- |
| Contributors | Stephen C. Graves., Massachusetts Institute of Technology. Engineering Systems Division., Massachusetts Institute of Technology. Engineering Systems Division. |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Format | 99 leaves, 5031557 bytes, 5042848 bytes, application/pdf, application/pdf, application/pdf |
| 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., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.002 seconds