Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-29210-1_70 | Operations Research Proceedings |
Field | DocType | ISSN |
Dynamic programming,Branch and bound,Mathematical optimization,Reorder point,Fixed cost,Poisson distribution,Service time,Mathematics | Conference | 0721-5924 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peng Li | 1 | 1 | 0.36 |
| Haoxun Chen | 2 | 773 | 60.23 |