Title:
The forward reserve warehouse sizing and dimensioning problem

Simple item page
dc.contributor.advisor Goetschalckx, Marc
dc.contributor.advisor McGinnis, Leon F.
dc.contributor.author Gu, Jinxiang en_US
dc.contributor.committeeMember Sharp, Gunter P.
dc.contributor.committeeMember Sokol, Joel
dc.contributor.committeeMember Paredis, Christiaan J. J.
dc.contributor.department Industrial and Systems Engineering en_US
dc.date.accessioned 2006-01-18T22:15:51Z
dc.date.available 2006-01-18T22:15:51Z
dc.date.issued 2005-09-12 en_US
dc.description.abstract This research addresses sizing and dimensioning of a forward-reserve warehouse, a strategic design problem that has important implications on warehouse life cycle costs including construction, inventory holding and replenishment, and material handling. Large mixed integer nonlinear models are developed that capture the complex tradeoffs among the different costs in order to achieve a global optimal design satisfying throughput requirements. We first consider the situation where the forward area includes all SKUs so that order picking is performed only in the forward area. In this case, the problem can be decomposed. The resulting sub-problem is convex and can be solved very efficiently based on the Karush-Kuhn-Tucker (KKT) conditions. This property enables the use of a Generalized Benders Decomposition (GBD) method to solve the sizing and dimensioning problem exactly. We then extend the problem to more general situations where the forward area contains a subset of SKUs. This requires integrating the sizing and dimensioning decisions with the decision to assign SKUs to the forward area based on their flow characteristics (i.e., the forward reserve allocation). A similar decomposition strategy can be employed, but the sub-problem (incorporating the forward reserve allocation) is no longer convex. A bi-level hierarchical heuristic approach is proposed that integrates a pattern search method for the master problem and optimal and heuristic algorithms for the sub-problems. Numerical results demonstrate that the proposed solution methods can efficiently find optimal or near optimal solutions for the sizing and dimensioning problem, and the resulting solutions are robust with regards to possible forecasting errors in design parameters. en_US
dc.description.degree Ph.D. en_US
dc.format.extent 1997260 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/7490
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.subject Decomposition en_US
dc.subject Optimization
dc.subject Layout
dc.subject Forward reserve warehouse
dc.title The forward reserve warehouse sizing and dimensioning problem en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor McGinnis, Leon F.
local.contributor.corporatename H. Milton Stewart School of Industrial and Systems Engineering
local.contributor.corporatename College of Engineering
relation.isAdvisorOfPublication 30930a5b-7e14-4844-9488-4c4e65f6fb7d
relation.isOrgUnitOfPublication 29ad75f0-242d-49a7-9b3d-0ac88893323c
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
gu_jinxiang_200512_phd.pdf
Size:
1.9 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations