<?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-19T23:00:11Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/33321" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/33321</identifier><datestamp>2026-06-06T01:03:35Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>com_1721.1_101402</setSpec><setSpec>col_1721.1_131023</setSpec><setSpec>col_1721.1_101610</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">Kerslake, Christopher Wayne</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. Engineering Systems Division</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-07-13T15:15:10Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-07-13T15:15:10Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/33321</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">62313581</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2005.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (leaves 67-68).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Currently, no adequate method exists for determining how frequently a retail store in a supermarket chain should receive deliveries from its distribution center. Existing methods neglect many crucial constraints, such as the necessity for deliveries to fall on fixed days of the week, severely limited shelf space, and the inability for many stores to hold additional overstock product in a backroom. This paper addresses the problem by outlining a new method for determining the delivery frequency by developing a simulation model for the replenishment process of a supermarket chain. The model can also be used to provide insight into other aspects of the replenishment process, such as shelf space allocation, and reorder rules. Using this model, we were able to show that significant cost savings were available to the supermarket chain we worked with on the project by changing the delivery schedules for their stores.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Christopher Wayne Kerslake.</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">68 leaves</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">3456586 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">3459571 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://dspace.mit.edu/handle/1721.1/7582</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">A method for analyzing the delivery frequency from a distribution center to a retail grocery store</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="2d60b632-e4f9-4248-af7b-690637739624">
	&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>A method for analyzing the delivery frequency from a distribution center to a retail grocery store&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2005&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Kerslake, Christopher Wayne&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>Engineering Systems Division.&lt;/Keyword>
   	&lt;Abstract>Currently, no adequate method exists for determining how frequently a retail store in a supermarket chain should receive deliveries from its distribution center. Existing methods neglect many crucial constraints, such as the necessity for deliveries to fall on fixed days of the week, severely limited shelf space, and the inability for many stores to hold additional overstock product in a backroom. This paper addresses the problem by outlining a new method for determining the delivery frequency by developing a simulation model for the replenishment process of a supermarket chain. The model can also be used to provide insight into other aspects of the replenishment process, such as shelf space allocation, and reorder rules. Using this model, we were able to show that significant cost savings were available to the supermarket chain we worked with on the project by changing the delivery schedules for their stores.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>