期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 294, 期 1, 页码 91-99出版社
ELSEVIER
DOI: 10.1016/j.ejor.2021.01.012
关键词
Inventory; (R,s,S) policy; Demand uncertainty; Stochastic lot sizing
资金
- Science Foundation Ireland [12/RC/2289-P2]
- European Regional Development Fund
The study introduces a hybrid approach combining tree search and stochastic dynamic programming to compute (R, s, S) policy parameters. By pruning up to 99.8% of the search tree using a branch-and-bound technique with bounds generated by dynamic programming, the method can solve instances of realistic size in a reasonable time.
A well-known control policy in stochastic inventory control is the (R, s, S) policy, in which inventory is raised to an order-up-to-level S at a review instant R whenever it falls below reorder-level s. To date, little or no work has been devoted to developing approaches for computing (R, s, S) policy parameters. In this work, we introduce a hybrid approach that exploits tree search to compute optimal replenishment cycles, and stochastic dynamic programming to compute (s, S) levels for a given cycle. Up to 99.8% of the search tree is pruned by a branch-and-bound technique with bounds generated by dynamic programming. A numerical study shows that the method can solve instances of realistic size in a reasonable time. (C) 2021 The Authors. Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据