<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-20T09:03:45Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/107516" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/107516</identifier><datestamp>2026-06-06T01:03:18Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Chris Caplice.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Khamsi, Cyril</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Stolear, Veronica</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Engineering Systems Division.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Supply Chain Management Program</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-03-20T19:37:58Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-03-20T19:37:58Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2016</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2016</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/107516</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">962735647</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis: M. Eng. in Logistics, Massachusetts Institute of Technology, Supply Chain Management Program, 2016.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (pages 52-53).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">To be competitive, businesses must make supply network design decisions, but often with only limited information and under uncertain conditions. How can an organization understand trade-offs between supply network decisions, without relying on complex, black-box models that require extensive data collection and hidden assumptions? We apply approximation methods to estimate and compare total logistics cost of supply network designs under various business conditions, such as variations in demand, changing costs, and shifting production policies. The method is applied to the real-world example of XYZ Co, evaluating network design choices for a new, rapidly growing product category: fresh foods. The method is used to evaluate tradeoffs between five distinct network designs for supply of these highly perishable foods to XYZ Co stores from a sole regional supplier. The model provides insights to help understand tradeoffs and key cost drivers, thereby channeling subsequent, more intensive and time- consuming analysis.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Cyril Khamsi and Veronica Stolear.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng. in Logistics</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">[vi], 53 pages</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">MIT theses may be protected by copyright.  Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Supply Chain Management Program.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Engineering Systems Division.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Efficient supply chain design for highly-perishable foods</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="031d2c36-138d-4daa-b36f-8b1b1e2b08b6">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Efficient supply chain design for highly-perishable foods&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2016&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Khamsi, Cyril&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
      	&lt;Author>
        	&lt;DisplayName>Stolear, Veronica&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Supply Chain Management Program.&lt;/Keyword>
    &lt;Keyword>Engineering Systems Division.&lt;/Keyword>
   	&lt;Abstract>To be competitive, businesses must make supply network design decisions, but often with only limited information and under uncertain conditions. How can an organization understand trade-offs between supply network decisions, without relying on complex, black-box models that require extensive data collection and hidden assumptions? We apply approximation methods to estimate and compare total logistics cost of supply network designs under various business conditions, such as variations in demand, changing costs, and shifting production policies. The method is applied to the real-world example of XYZ Co, evaluating network design choices for a new, rapidly growing product category: fresh foods. The method is used to evaluate tradeoffs between five distinct network designs for supply of these highly perishable foods to XYZ Co stores from a sole regional supplier. The model provides insights to help understand tradeoffs and key cost drivers, thereby channeling subsequent, more intensive and time- consuming analysis.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>