2026-09-22T04:57:53Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/447412022-01-13T07:54:52Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022

Stephen C. Graves. Schoenmeyr, Tor (Tor Ivar) Sloan School of Management. Sloan School of Management 2009-03-16T19:36:45Z 2009-03-16T19:36:45Z 2008 2008 http://hdl.handle.net/1721.1/44741 298551173 Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 2008. Includes bibliographical references (p. 134-137). A central question in supply chain management is how to coordinate activities and inventories over a large number of stages and locations, while providing a high level of service to end customers. One theoretically and practically important methodology for addressing this problem is the guaranteed service (GS) framework, in which the stages of the supply chain operate according to base stock policies, and prove guaranteed service to one another. Demand is assumed to be bounded. Previous work on GS models has established very effective algorithms for finding optimal safety stock placement. In the first essay of the thesis, we show how these methods can be generalized to handle problems with capacity constraints. Furthermore, we investigate orders that are censored (reduced so as to prevent deliveries greater than what can be processed). We find safety stock reductions, sometimes even below what was needed in the no-constraint situation. In the second essay, we investigate a situation in which different parts of the supply chain are controlled by different parties, each of which selfishly applies its own GS optimization. We find that provided that the parties can agree on the right service time between them, it will be in their own interests to maintain the globally optimal solution (i.e., the system is incentive compatible). This suggests that the GS framework is better suited for coordination, than are other frameworks analyzed in the coordination literature. Finally, in the third essay, we apply the GS framework to a setting where orders are driven by forecasts and schedules, rather than by past demand as in previous GS work. We show precisely how the demand bound can be replaced by a bound on forecast errors, and that existing optimization methods can be used. (cont.) In a case study, we obtained data from the supply chain of an electronic test system, as well as characterized the forecasting process. We found that incorporating the forecast process led to 25% reduction of safety stocks. by Tor Schoenmeyr. Ph.D. 137 p. eng Massachusetts Institute of Technology 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 Sloan School of Management. Strategic inventory placement in multi-echelon supply chains : three essays Thesis application/pdf Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="87d42018-5263-41de-8e9a-2861770c7bd5"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Strategic inventory placement in multi-echelon supply chains : three essays</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2008</PublicationDate> <Authors> <Author> <DisplayName>Schoenmeyr, Tor (Tor Ivar)</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Sloan School of Management.</Keyword> <Abstract>A central question in supply chain management is how to coordinate activities and inventories over a large number of stages and locations, while providing a high level of service to end customers. One theoretically and practically important methodology for addressing this problem is the guaranteed service (GS) framework, in which the stages of the supply chain operate according to base stock policies, and prove guaranteed service to one another. Demand is assumed to be bounded. Previous work on GS models has established very effective algorithms for finding optimal safety stock placement. In the first essay of the thesis, we show how these methods can be generalized to handle problems with capacity constraints. Furthermore, we investigate orders that are censored (reduced so as to prevent deliveries greater than what can be processed). We find safety stock reductions, sometimes even below what was needed in the no-constraint situation. In the second essay, we investigate a situation in which different parts of the supply chain are controlled by different parties, each of which selfishly applies its own GS optimization. We find that provided that the parties can agree on the right service time between them, it will be in their own interests to maintain the globally optimal solution (i.e., the system is incentive compatible). This suggests that the GS framework is better suited for coordination, than are other frameworks analyzed in the coordination literature. Finally, in the third essay, we apply the GS framework to a setting where orders are driven by forecasts and schedules, rather than by past demand as in previous GS work. We show precisely how the demand bound can be replaced by a bound on forecast errors, and that existing optimization methods can be used.</Abstract> <Abstract>(cont.) In a case study, we obtained data from the supply chain of an electronic test system, as well as characterized the forecasting process. We found that incorporating the forecast process led to 25% reduction of safety stocks.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>