Yau Man-Kuen. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 222-234). / Abstracts in English and Chinese. / Chapter Chapter 0 --- Introduction --- p.1 / Chapter PART A: --- Logistics in Hong Kong 一 Overview and Prospects / Chapter A.1 --- Study Objectives --- p.3 / Chapter A.2 --- Methodology --- p.4 / Chapter A.3 --- What is Logistics? --- p.4 / Chapter A.3.1 --- Major Trends --- p.6 / Chapter A.4 --- Key Features of the Logistics in Hong Kong & China --- p.8 / Chapter A.4.1 --- China Industry --- p.8 / Chapter A.4.2 --- National Developments in China --- p.13 / Chapter A.4.3 --- Hong Kong Industry --- p.16 / Chapter A.5 --- Growth Trends & Statistics for Hong Kong --- p.25 / Chapter A.6 --- Competitive Analysis for Hong Kong as a Logistics Hub --- p.45 / Chapter A.6.1 --- Current Industry Strengths --- p.45 / Chapter A.6.2 --- Current Industry Weaknesses --- p.46 / Chapter A.6.3 --- Competitiveness Challenges --- p.47 / Chapter A.6.4 --- Future Opportunities --- p.51 / Chapter A.7 --- Changing Conditions and Infrastructure Needs --- p.54 / Chapter A.7.1 --- Trade --- p.54 / Chapter A.7.2 --- Technology --- p.56 / Chapter A.7.3 --- Investment --- p.56 / Chapter A.7.4 --- Human Resources --- p.57 / Chapter A.7.5 --- Government and Regulation --- p.58 / Chapter A.8 --- Recommendations --- p.61 / Chapter A.9 --- Conclusions --- p.64 / Chapter A.10 --- Future Work --- p.65 / Chapter PART B: --- Inventory Management with Advance Ordering / Chapter Chapter B.1 --- Introduction --- p.66 / Chapter B.1.1 --- Overview --- p.66 / Chapter B.1.2 --- Literature Review --- p.69 / Chapter Chapter B.2 --- Model Formulation --- p.72 / Chapter B.2.1 --- Introduction --- p.72 / Chapter B.2.2 --- Mathematical Model --- p.74 / Chapter B.2.3 --- Preliminaries --- p.76 / Chapter B.2.4 --- Table of variables --- p.77 / Chapter Chapter B.3 --- Study of Window Size0 --- p.79 / Chapter B.3.1 --- Introduction --- p.79 / Chapter B.3.2 --- Mathematical Model --- p.79 / Chapter B.3.3 --- Proof of Window Size0 --- p.81 / Chapter Chapter B.4 --- Study of Window Size1 --- p.94 / Chapter B.4.1 --- Introduction --- p.94 / Chapter B.4.2 --- Mathematical Model --- p.95 / Chapter B.4.3 --- Optimal Ordering Policy for Window Size1 --- p.95 / Chapter B.4.4 --- Special Case of Uniformly Distributed Demand --- p.109 / Chapter B.4.5 --- Discussion of Fukuda's Paper --- p.114 / Chapter Chapter B.5 --- Simulation Study of Window Size1 --- p.120 / Chapter B.5.1 --- Simulation Models --- p.120 / Chapter B.5.2 --- Simulation Program Structure --- p.126 / Chapter B.5.3 --- Simulation Numerical Analysis --- p.131 / Chapter Chapter B.6 --- Simulation Study of Window Size K --- p.172 / Chapter B.6.1 --- Simulation Models --- p.172 / Chapter B.6.2 --- Simulation Program Structure --- p.179 / Chapter B.6.3 --- Simulation Numerical Analysis --- p.181 / Chapter Chapter B.7 --- Conclusion and Further Studies --- p.201 / Appendix (PART A) --- p.204 / Appendix (PART B) --- p.208 / Bibliography (PART A) --- p.222 / Bibliography (PART B) --- p.229

Shrinking profit margins in the high technology industry has led companies to attempt to increase profits through an increased focus on after-market services. As part of that effort, service parts logistics, which manages the post-sales distribution of spare parts needed to maintain and repair products in use, has gained importance. In an effort to improve Service Parts Logistics (SPL) operations, we integrate facility location and inventory stocking decisions while classifying facilities based on their assignment; dedicated facilities that are assigned solely to individual customers (located on-site of the customer, serving only that customer), and shared facilities that are assigned to a subset of customers. The introduction of dedicated facilities simplifies the overall problem formulation in certain special cases. In one such special case where there is only one facility and none of the customers are within its service time window, the overall problem reduces to a binary knapsack formulation. This can be solved in pseudo-polynomial time through the dynamic programming algorithm for such problems. Nonetheless, even in the general case, we identify conditions under which a dedicated facility will always be opened. Computational results show that this observation is used by solvers as a preprocessing step, thus loosening some hard constraints. As a result, some of these problems are solved in less time than the corresponding problems without the dedicated facilities. However, dedicated facilities become advantageous mainly in sparse networks as opposed to dense networks. Apart from low network density, low holding cost and relatively high demand are two other system parameters that encourage the opening of dedicated facilities. SPL can be further improved by sharing inventory across shared facilities, which is already a common practice in real SPL systems. In this case, Markov chains can be used to estimate fill rates, but the process is iterative. However, under the low demand assumption of parts in SPL, we derive analytical formulae of estimating fill rates and thus incorporate inventory sharing within the network design and inventory optimization model. Special cases of this problem can be solved by an alternative binary knapsack formulation. Computational results show that large instances can be solved instantaneously, and we also identify a greedy heuristic that provides bounds on average within 0.12% of the optimal solution. We observe maximum benefit from inventory sharing when there exists large demand in the area overlapping the time window of both shared facilities and when inventory replenishment rates are high. However, we also identify conditions on the system parameters where inventory sharing could increase cost and/or decrease service in comparison with not-sharing. The combined problem of inventory sharing with customer dedicated facilities is formulated based on a binary knapsack structure. However, the problem size increases exponentially with solution time. Therefore, we construct another greedy heuristic by combining the inventory sharing heuristic and a special case algorithm for a single dedicated facility. A large size problem that takes almost a minute to be solved by conventional branch and bound is solved in less than a second using the greedy heuristic. We also show that for a given demand network, the combined problem achieves 40-60% reduction in total cost within 1% of the time taken by the problem without inventory sharing and without dedicated facilities. Another interesting result is that in some cases, adding new customers to a given inventory sharing system helps to reduce the cost and/or increase service. / text