<?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-20T02:41:33Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/40386" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/40386</identifier><datestamp>2022-01-13T07:54:48Z</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">Stephen C. Graves.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Chhaochhria, Pallav</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Operations Research Center.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Operations Research Center</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Sloan School of Management</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-02-27T22:18:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-02-27T22:18:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2007</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/40386</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">191222012</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2007.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 81).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">A large online retailer strategically stocks inventory for SKUs with low demand. The motivations are to provide a wide range of selections and faster customer fulfillment service. We assume the online retailer has the technological capability to manage and control the inventory globally: all warehouses act as one to serve the global demand simultaneously. The online retailer will utilize its entire inventory, regardless of location, to serve demand. We study inventory allocation and order fulfillment policies among warehouses for low-demand SKUs at an online retailer. Thus, given the global demand and an order fulfillment policy, there are tradeoffs involving inventory holding costs, transportation costs, and backordering costs in determining the optimal system inventory level and allocation of inventory to warehouses. For the case of Poisson demand and constant replenishment lead time, we develop methods to approximate the key system performance metrics like transshipment, backorders and average system inventory for one-for-one replenishment policies when warehouses hold exactly one unit of inventory. We run computational experiments to test the accuracy of the approximation. We develop extensions for cases when more than one unit of inventory is held at a warehouse.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">(cont.) We then use these results to develop guidelines for inventory stocking and order fulfillment policies for online retailers. We also compare warehouse allocation policies for conditions when an order arrives but the preferred warehouse does not have stock although there is stock at more than one other location in the system. We develop intuition about the performance of these policies and run simulations to verify our hypotheses about these policies.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Pallav Chhaochhria.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">81 p.</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">Operations Research Center.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Inventory planning for low demand items in online retailing</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="b16f22b2-8db1-40d9-9c2a-f8d01b97ce48">
	&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>Inventory planning for low demand items in online retailing&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2007&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Chhaochhria, Pallav&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>Operations Research Center.&lt;/Keyword>
   	&lt;Abstract>A large online retailer strategically stocks inventory for SKUs with low demand. The motivations are to provide a wide range of selections and faster customer fulfillment service. We assume the online retailer has the technological capability to manage and control the inventory globally: all warehouses act as one to serve the global demand simultaneously. The online retailer will utilize its entire inventory, regardless of location, to serve demand. We study inventory allocation and order fulfillment policies among warehouses for low-demand SKUs at an online retailer. Thus, given the global demand and an order fulfillment policy, there are tradeoffs involving inventory holding costs, transportation costs, and backordering costs in determining the optimal system inventory level and allocation of inventory to warehouses. For the case of Poisson demand and constant replenishment lead time, we develop methods to approximate the key system performance metrics like transshipment, backorders and average system inventory for one-for-one replenishment policies when warehouses hold exactly one unit of inventory. We run computational experiments to test the accuracy of the approximation. We develop extensions for cases when more than one unit of inventory is held at a warehouse.&lt;/Abstract>
   	&lt;Abstract>(cont.) We then use these results to develop guidelines for inventory stocking and order fulfillment policies for online retailers. We also compare warehouse allocation policies for conditions when an order arrives but the preferred warehouse does not have stock although there is stock at more than one other location in the system. We develop intuition about the performance of these policies and run simulations to verify our hypotheses about these policies.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>