Optimal (R, nQ) Policies for Serial Inventory Systems with Guaranteed Service - Université de technologie de Troyes Access content directly
Book Sections Year : 2012

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.
No file

Dates and versions

hal-02500610 , version 1 (06-03-2020)

Identifiers

Cite

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⟩

Collections

CNRS UTT LOSI
10 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More