TY - JOUR
T1 - A new method for joint replenishment problems
AU - Fung, R. Y K
AU - Ma, X.
PY - 2001
Y1 - 2001
N2 - This paper considers joint replenishment problems (JRP) of n items under deterministic and constant demand. Two new algorithms for JRP are proposed, based on a pair of tighter bounds for optimal cyclic time. The proposed algorithms can be used to determine the optimal cyclic policy and the optimal strict cyclic policy. Both algorithms are qualified for JRP with small major set-up costs, while only one of them can cope with JRP with any type of major set-up costs. Numerical experiments on randomly generated problems show that the new algorithms significantly outperform the existing exact algorithms for almost all of the test problems. © 2001 Operational Research Society Ltd. All rights reserved.
AB - This paper considers joint replenishment problems (JRP) of n items under deterministic and constant demand. Two new algorithms for JRP are proposed, based on a pair of tighter bounds for optimal cyclic time. The proposed algorithms can be used to determine the optimal cyclic policy and the optimal strict cyclic policy. Both algorithms are qualified for JRP with small major set-up costs, while only one of them can cope with JRP with any type of major set-up costs. Numerical experiments on randomly generated problems show that the new algorithms significantly outperform the existing exact algorithms for almost all of the test problems. © 2001 Operational Research Society Ltd. All rights reserved.
KW - Deterministic demand
KW - Inventory
KW - Joint replenishment
UR - http://www.scopus.com/inward/record.url?scp=0035280433&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0035280433&origin=recordpage
U2 - 10.1057/palgrave.jors.2601091
DO - 10.1057/palgrave.jors.2601091
M3 - RGC 21 - Publication in refereed journal
SN - 0160-5682
VL - 52
SP - 358
EP - 362
JO - Journal of the Operational Research Society
JF - Journal of the Operational Research Society
IS - 3
ER -