Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/24067
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Huang, Kai | - |
dc.contributor.author | Chu, Jie | - |
dc.date.accessioned | 2019-03-21T13:52:36Z | - |
dc.date.available | 2019-03-21T13:52:36Z | - |
dc.date.issued | 2018 | - |
dc.identifier.uri | http://hdl.handle.net/11375/24067 | - |
dc.description.abstract | In this thesis, we study three periodic-review, finite-horizon inventory systems in the presence of supply and demand uncertainties. In the first part of the thesis, we study a multi-period single-station problem in which supply uncertainty is modeled by partial supply. Formulating the problem under a robust optimization (RO) framework, we show that solving the robust counterpart is equivalent to solving a nominal problem with a modified deterministic demand sequence. In particular, in the stationary case the optimal robust policy follows the quasi-(s, S) form and the corresponding s and S levels are theoretically computable. In the second part of the thesis, we extend the RO framework to a multi-period multi-echelon problem. We show that for a tree structure network, decomposition applies so that the optimal single-station robust policy remains valid for each echelon in the tree. Furthermore, if there are no setup costs in the network, then the problem can be decomposed into several uncapacitated single-station problems with new cost parameters subject to the deterministic demands. In the last part of the thesis, we consider a periodic-review Assemble-To-Order (ATO) system with multiple components and multiple products, where the inventory replenishment for each component follows an independent base-stock policy and product demands are satisfied according to a First-Come-First-Served (FCFS) rule. We jointly consider the inventory replenishment and component allocation problems in the ATO system under stochastic component replenishment lead times and stochastic product demands. The problems are formulated under the stochastic programming (SP) framework, which are difficult to solve exactly due to a large number of scenarios. We use the sample average approximation (SAA) algorithms to find near-optimal solutions, which accuracy is verified by the numerical experiment results. | en_US |
dc.language.iso | en | en_US |
dc.subject | Inventory management | en_US |
dc.subject | Robust optimization | en_US |
dc.subject | Stochastic programming | en_US |
dc.subject | Supply and demand uncertainties | en_US |
dc.title | Robust Inventory Management under Supply and Demand Uncertainties | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | Business | en_US |
dc.description.degreetype | Thesis | en_US |
dc.description.degree | Doctor of Philosophy (PhD) | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Chu_Jie_201809_PhD.pdf | 1.42 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.