An algorithm for determining the best lower bound for the Stochastic joint replenishment problem
成果类型：
Article
署名作者：
Viswanathan, S.
署名单位：
Nanyang Technological University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1070.0401
发表日期：
2007
页码：
992-996
关键词：
摘要：
We develop an algorithm for determining the highest among the class of lower bounds proposed by Atkins and Iyogun (1988) for the joint replenishment problem (JRP) with stochastic demands. The proposed algorithm is simple and does not require many more calculations than an existing lower bound based on equalization of expected runout times.