Note: Dynamic lot sizing for a finite rate input process
这篇注记展示了如何将经典的动态批量求解方法（如Wagner-Whitin算法）调整应用于输入为有限速率生产过程的场景，对研究生产计划与库存控制的学者有参考价值。
The basic single-product dynamic lot-sizing problem involves determining the optimal batch production schedule to meet a deterministic, discrete-in-time, varying demand pattern subject to linear setup and stockholding costs. The most widely known procedure for deriving the optimal solution is the Wagner-Whitin algorithm, although many other approaches have subsequently been developed for tackling the same problem. The objective of this note is to show how these procedures can readily be adapted when the input is a finite rate production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 221–228, 1997