FINDING OPTIMAL (S, S) POLICIES IS ABOUT AS SIMPLE AS EVALUATING A SINGLE POLICY
成果类型：
Article
署名作者：
ZHENG, YS; FEDERGRUEN, A
署名单位：
Columbia University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.39.4.654
发表日期：
1991
页码：
654-665
关键词：
摘要：
In this paper, a new algorithm for computing optimal (s, S) policies is derived based upon a number of new properties of the infinite horizon cost function c(s, S) as well as a new upper bound for optimal order-up-to levels S* and a new lower bound for optimal reorder levels S*. The algorithm is simple and easy to understand. Its computational complexity is only 2.4 times that required to evaluate a (specific) single (s, S) policy. The algorithm applies to both periodic review and continuous review inventory systems.