Skip to Main content Skip to Navigation
Book sections

Optimal (R, nQ) Policies for Serial Inventory Systems with Guaranteed Service

Abstract : 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.
Document type :
Book sections
Complete list of metadata
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Friday, March 6, 2020 - 11:03:19 AM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM





Peng Li, Haoxun Chen. Optimal (R, nQ) Policies for Serial Inventory Systems with Guaranteed Service. Operations Research Proceedings 2011, pp.439-444, 2012, Operations Research Proceedings (GOR (Gesellschaft für Operations Research e.V.)), ⟨10.1007/978-3-642-29210-1_70⟩. ⟨hal-02500610⟩



Record views