Note: Optimal Policies for Serial Inventory Systems Under Fill Rate Constraints
研究在填充率约束下，如何最小化串行生产/分销系统的持有成本，证明最优策略是某种随时间变化的(R, nQ)策略，并给出简单求解方法。
A continuous review serial production/distribution system with discrete compound Poisson demand for the end product is considered. Unmet demand is back-ordered. Production/transportation times are constant. All deliveries from one stage to the next must be multiples of given batch sizes. We consider the problem of minimizing the holding costs under a fill rate constraint. Using recent results by Chen (2000), we show that under a set of restricted but plausible assumptions, the optimal policy is an echelon stock multistage (R, nQ) policy with one of the reorder points varying over time. We provide a simple procedure for the determination of the optimal policy.