<?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-11-21T06:45:42Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/20483" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/20483</identifier><datestamp>2026-09-24T19:13:36Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</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">Huang, Kai</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">E, Fan</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computational Engineering and Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2016-09-23T19:40:36Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2016-09-23T19:40:36Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2016</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/20483</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/20789</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In this paper, a two-stage stochastic facility location problem integrated with inven- tory and recourse decisions is studied and solved. This problem is inspired by an industrial supply chain design problem of a large retail chain with slow-moving prod- ucts. Uncertainty is expressed by a discrete and finite set of scenarios. Recourse actions can be taken after the realization of random demands. Location, inventory, transportation, and recourse decisions are integrated into a mixed-integer program with an objective minimizing the expected total cost. A dual heuristic procedure is studied and embedded into the sample average approximation (SAA) method. The computation experiments demonstrate that our combined SAA with dual heuristic algorithm has a similar performance on solution quality and a much shorter compu- tational time.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Applied Science (MASc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">stochastic facility location problem;</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">sample average approximation</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">dual heuristic</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">location-inventory problem</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">A Location-Inventory Problem for Customers with Time Constraints</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Article</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>