<?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-19T00:00:38Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/146652" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/146652</identifier><datestamp>2022-12-01T03:48:01Z</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">Freund, Daniel</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Kim, Sang-Gook</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Jiang, Run</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Mechanical Engineering</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Sloan School of Management</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-11-30T19:39:08Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-11-30T19:39:08Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-05</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2022-08-25T19:15:30.877Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1721.1/146652</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Amazon Logistics’ delivery stations process two types of packages: oversized packages (OV) and non-OV packages (non-OV). Currently, the placement of OV to OV racks is coupled with non-OV placement to non-OV racks because Amazon’s algorithm does not explicitly assign OV to a rack but places it in the rack where the non-OV package of the closest delivery destination is. The result is frequent overflow from OV rack to floor for some racks while very few packages in others, leading to severely inefficient use of space and uneven labor distribution.&#xd;
&#xd;
This project identifies the root cause of the problem and develops 4 solutions to eliminate overflow and evenly distribute the packages within a delivery station. Different configurations and current package placement assignment methodologies are considered and current industry work on optimally assigning and picking products of different types is reviewed. Based on this research, we modeled package placement using integer linear programming, dynamic averaging, and pooling.&#xd;
&#xd;
This thesis provides general frameworks for optimizing placing and picking different types of products in a warehouse setting through the case of two product types scenario. It can be further expanded to multiple product type scenarios in a general supply chain and logistics system where efficient and fair use of resources has been a constant challenge.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">M.B.A.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">S.M.</dim:field>
   <dim:field mdschema="dc" element="publisher">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights">In Copyright - Educational Use Permitted</dim:field>
   <dim:field mdschema="dc" element="rights">Copyright retained by author(s)</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">https://rightsstatements.org/page/InC-EDU/1.0/</dim:field>
   <dim:field mdschema="dc" element="title">Oversized Package Placement Optimization in Warehouses</dim:field>
   <dim:field mdschema="dc" element="type">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="mit" element="thesis" qualifier="degree">Master</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Master of Business Administration</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Master of Science in Mechanical Engineering</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="0e839005-28f7-49ed-a8af-2cca750a9327">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
   	&lt;Title>Oversized Package Placement Optimization in Warehouses&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2022-05&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Jiang, Run&lt;/DisplayName&gt;
         	&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>https://rightsstatements.org/page/InC-EDU/1.0/&lt;/License>
   	&lt;Abstract>Amazon Logistics’ delivery stations process two types of packages: oversized packages (OV) and non-OV packages (non-OV). Currently, the placement of OV to OV racks is coupled with non-OV placement to non-OV racks because Amazon’s algorithm does not explicitly assign OV to a rack but places it in the rack where the non-OV package of the closest delivery destination is. The result is frequent overflow from OV rack to floor for some racks while very few packages in others, leading to severely inefficient use of space and uneven labor distribution.&#xd;
&#xd;
This project identifies the root cause of the problem and develops 4 solutions to eliminate overflow and evenly distribute the packages within a delivery station. Different configurations and current package placement assignment methodologies are considered and current industry work on optimally assigning and picking products of different types is reviewed. Based on this research, we modeled package placement using integer linear programming, dynamic averaging, and pooling.&#xd;
&#xd;
This thesis provides general frameworks for optimizing placing and picking different types of products in a warehouse setting through the case of two product types scenario. It can be further expanded to multiple product type scenarios in a general supply chain and logistics system where efficient and fair use of resources has been a constant challenge.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>