Simple Newsvendor Bounds for Inventory Distribution Systems
To date, closed form optimal solutions for stocking levels in arborescent multiechelon inventory systems have not been obtained. These problems exhibit the joint difficulties of requiring an allocation policy as well as a stocking policy, and the multidimensional nature of their state space makes d...
Main Author: | |
---|---|
Published: |
Georgia Institute of Technology
2007
|
Subjects: | |
Online Access: | http://hdl.handle.net/1853/14591 |
id |
ndltd-GATECH-oai-smartech.gatech.edu-1853-14591 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-GATECH-oai-smartech.gatech.edu-1853-145912013-01-07T20:16:51ZSimple Newsvendor Bounds for Inventory Distribution SystemsLystad, Erik D.SimulationHeuristicsInventoryDistribution systemsSupply chain managementTo date, closed form optimal solutions for stocking levels in arborescent multiechelon inventory systems have not been obtained. These problems exhibit the joint difficulties of requiring an allocation policy as well as a stocking policy, and the multidimensional nature of their state space makes dynamic programming formulations impractical. In this dissertation, we introduce procedures that approximate multiechelon networks with sets of single installation problems. We first use this technique to solve for base-stock levels in a distribution network with asymmetric retailers. Second, we use this technique to analyze delayed differentiation production processes and provide guidance as to when the strategy is most warranted. Third, we modify the technique to account for inventory that exhibits perishability and solve for stocking policies for distribution systems when the inventory has a fixed shelf life.Georgia Institute of Technology2007-05-25T17:35:30Z2007-05-25T17:35:30Z2006-12-19Dissertationhttp://hdl.handle.net/1853/14591 |
collection |
NDLTD |
sources |
NDLTD |
topic |
Simulation Heuristics Inventory Distribution systems Supply chain management |
spellingShingle |
Simulation Heuristics Inventory Distribution systems Supply chain management Lystad, Erik D. Simple Newsvendor Bounds for Inventory Distribution Systems |
description |
To date, closed form optimal solutions for stocking levels in arborescent multiechelon inventory systems have not been obtained. These problems exhibit the joint difficulties of requiring an allocation policy as well as a stocking policy, and the multidimensional nature of their state space makes dynamic programming formulations impractical. In this dissertation, we introduce procedures that approximate multiechelon networks with sets of single installation problems. We first use this technique to solve for base-stock levels in a distribution network with asymmetric retailers. Second, we use this technique to analyze delayed differentiation production processes and provide guidance as to when the strategy is most warranted. Third, we modify the technique to account for inventory that exhibits perishability and solve for stocking policies for distribution systems when the inventory has a fixed shelf life. |
author |
Lystad, Erik D. |
author_facet |
Lystad, Erik D. |
author_sort |
Lystad, Erik D. |
title |
Simple Newsvendor Bounds for Inventory Distribution Systems |
title_short |
Simple Newsvendor Bounds for Inventory Distribution Systems |
title_full |
Simple Newsvendor Bounds for Inventory Distribution Systems |
title_fullStr |
Simple Newsvendor Bounds for Inventory Distribution Systems |
title_full_unstemmed |
Simple Newsvendor Bounds for Inventory Distribution Systems |
title_sort |
simple newsvendor bounds for inventory distribution systems |
publisher |
Georgia Institute of Technology |
publishDate |
2007 |
url |
http://hdl.handle.net/1853/14591 |
work_keys_str_mv |
AT lystaderikd simplenewsvendorboundsforinventorydistributionsystems |
_version_ |
1716474642548391936 |