Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
将多物品联合补货问题推广到订货成本依赖于具体物品组合的情形，提出一种动态规划算法来划分物品组并确定各组的最优固定周期，从而得到最优补货策略。
The multi-item joint replenishment problem is generalized to allow ordering costs to be dependent on the specific items jointly supplied. A fixed cycle approach is examined in which all the items of a group are always jointly replenished. A dynamic programming algorithm is developed for partitioning the items into groups, each with its own fixed cycle time, resulting in an optimal fixed cycle replenishment policy.