東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Managing service parts logistics: I...

Zhao, Hui.

FindBook

Google Book

Amazon

博客來

Managing service parts logistics: Inventory sharing and rationing in decentralized and centralized distribution networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Managing service parts logistics: Inventory sharing and rationing in decentralized and centralized distribution networks./
作者:	Zhao, Hui.
面頁冊數:	196 p.
附註:	Source: Dissertation Abstracts International, Volume: 64-11, Section: B, page: 5711.
Contained By:	Dissertation Abstracts International64-11B.
標題:	Engineering, Industrial. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3113895
ISBN:	0496613882

Managing service parts logistics: Inventory sharing and rationing in decentralized and centralized distribution networks.
Zhao, Hui.

Managing service parts logistics: Inventory sharing and rationing in decentralized and centralized distribution networks. - 196 p.

Source: Dissertation Abstracts International, Volume: 64-11, Section: B, page: 5711.

Thesis (Ph.D.)--Purdue University, 2003.

In this dissertation, we consider an inventory sharing and rationing problem in continuous-review, infinite-horizon, distribution networks. Unlike previous literature on inventory sharing, we model inventory sharing as a multiple demand classes problem in which each dealer faces two classes of demand: his own customers and inventory sharing requests from other dealers. We first focus on a decentralized system in which each individual dealer is independent of the manufacturer and thus makes his own inventory decisions in order to minimize his own cost. We analyze inventory sharing in two different settings: a make-to-stock decentralized system with exponential replenishment lead time; and a decentralized system with constant replenishment lead time. For these two models, we use different approaches to obtain dealers' performance measures and cost functions, and then use a game theoretic approach to characterize the equilibrium behavior of the individual dealers. Comprehensive computational studies are conducted for both models, highlighting the impact of the manufacturer's incentives and the cost of sharing on dealers' sharing behavior in a decentralized system. We believe that these two models are the first attempt to simultaneously consider inventory sharing, inventory rationing, and decentralized decision making. To complete our analysis, we also consider an inventory sharing and rationing problem in a centralized network. We focus our analysis on a make-to-stock inventory sharing system, which enables us to consider capacity issues in inventory transshipment, which has not been studied in previous work. Compared to previous literature, we consider transshipment in a much broader sense. Transshipment can be used for transferring inventory for emergency demand filling and balancing inventory allocation between different locations, as well as achieving production capacity flexibility. For the centralized inventory sharing system, we prove the structure of the optimal policy, analyze structural properties of the optimal policy parameters, and provide conditions that simplify the optimal policy. We also conduct a numerical sensitivity analysis of the optimal solution to different cost parameters. We conclude with a discussion of a heuristic developed from our understanding of the true optimal policy.

ISBN: 0496613882Subjects--Topical Terms:

626639
Engineering, Industrial.

Managing service parts logistics: Inventory sharing and rationing in decentralized and centralized distribution networks.
LDR:03362nmm 2200301 4500 001 1836583
005 20050315120506.5
008 130614s2003 eng d
020 $a 0496613882
035 $a (UnM)AAI3113895
035 $a AAI3113895
040 $a UnM $c UnM
100 1 $a Zhao, Hui. $3 1028957
245 1 0 $a Managing service parts logistics: Inventory sharing and rationing in decentralized and centralized distribution networks.
300 $a 196 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-11, Section: B, page: 5711.
500 $a Major Professors: Jennifer K. Ryan; Vinayak Deshpande.
502 $a Thesis (Ph.D.)--Purdue University, 2003.
520 $a In this dissertation, we consider an inventory sharing and rationing problem in continuous-review, infinite-horizon, distribution networks. Unlike previous literature on inventory sharing, we model inventory sharing as a multiple demand classes problem in which each dealer faces two classes of demand: his own customers and inventory sharing requests from other dealers. We first focus on a decentralized system in which each individual dealer is independent of the manufacturer and thus makes his own inventory decisions in order to minimize his own cost. We analyze inventory sharing in two different settings: a make-to-stock decentralized system with exponential replenishment lead time; and a decentralized system with constant replenishment lead time. For these two models, we use different approaches to obtain dealers' performance measures and cost functions, and then use a game theoretic approach to characterize the equilibrium behavior of the individual dealers. Comprehensive computational studies are conducted for both models, highlighting the impact of the manufacturer's incentives and the cost of sharing on dealers' sharing behavior in a decentralized system. We believe that these two models are the first attempt to simultaneously consider inventory sharing, inventory rationing, and decentralized decision making. To complete our analysis, we also consider an inventory sharing and rationing problem in a centralized network. We focus our analysis on a make-to-stock inventory sharing system, which enables us to consider capacity issues in inventory transshipment, which has not been studied in previous work. Compared to previous literature, we consider transshipment in a much broader sense. Transshipment can be used for transferring inventory for emergency demand filling and balancing inventory allocation between different locations, as well as achieving production capacity flexibility. For the centralized inventory sharing system, we prove the structure of the optimal policy, analyze structural properties of the optimal policy parameters, and provide conditions that simplify the optimal policy. We also conduct a numerical sensitivity analysis of the optimal solution to different cost parameters. We conclude with a discussion of a heuristic developed from our understanding of the true optimal policy.
590 $a School code: 0183.
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Business Administration, Management. $3 626628
650 4 $a Operations Research. $3 626629
690 $a 0546
690 $a 0454
690 $a 0796
710 2 0 $a Purdue University. $3 1017663
773 0 $t Dissertation Abstracts International $g 64-11B.
790 1 0 $a Ryan, Jennifer K., $e advisor
790 1 0 $a Deshpande, Vinayak, $e advisor
790 $a 0183
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3113895