A Sequential Lot Sizing Heuristic with Optimal Average Performance
针对无缺货的动态批量问题，提出一种在独立同分布需求下具有最优平均性能的序列决策规则，并与Silver-Meal启发式进行比较，还分析了允许向前看一期的情况。
The classical dynamic lot size problem without backlogging is in practice usually solved with the aid of various heuristics. Most heuristics are sequential techniques, i.e. the future demand is considered period for period, and a decision whether to have a set-up or not in a certain period is taken without regarding the future demand. The average performance of a lot sizing heuristic will depend on the demand process. We assume that a typical demand will look like a sequence of independent identically distributed random numbers, and we derive a sequential lot sizing rule with optimal average performance under such circumstances. The optimal decision rule is compared to the Silver-Meal heuristic. We also analyze the situation when the decision rule is allowed to look ahead one period.