Optimal (R, nQ) Policies for Serial Inventory Systems with Guaranteed Service
In this paper, serial inventory systems with Poisson external demand and fixed costs at each stock are considered and the guaranteed-service approach (GSA) is used to design their optimal echelon (R, nQ) inventory policies. The problem is decomposed into two independent sub-problems, batch size decision sub-problem and reorder point decision sub-problem, which are solved optimally by using a dynamic programming algorithm and a branch and bound algorithm, respectively. Numerical experiments on randomly generated instances demonstrate the efficiency of these algorithms.
KeywordsService Time Customer Demand Inventory Policy Average Computation Time Inventory Replenishment
Unable to display preview. Download preview PDF.
- 1.Chen, F., Y. -S. Zheng.:Near-optimal echelon-stock (R,nq) policiers in multistage serial systems. Operations Research. 46, 592-602.(1998)Google Scholar
- 2.Hadley, G., T. M. Whitin.:A family of inventory model. Management Science, 7, 351-371.(1961)Google Scholar
- 3.Graves, S. C., Willems, S. P.: Strategic safety stock placement in supply chain. Proceedings of the 1996 MSOM Conference, Hanover, NH.(1996)Google Scholar