Strong turnpike policies in the single‐item capacitated lot‐sizing problem with periodical dynamic parameter
研究了单产品有容量批量问题，假设需求和成本周期性变化，证明了存在最优无限逆策略和强收费公路策略，并给出了简单的前向算法。
This article considers optimization problems in a discrete capacitated lot sizing model for a single product with limited backlogging. The demand as well as the holding and backlogging costs are assumed to be periodical in time. Nothing is assumed about types of the cost functions. It is shown that there exists an optimal infinite inverse policy and a strong turnpike policy. A forward algorithm for computing optimal policies relative to the class of batch ordering type policies is derived. Some backward procedure is adopted to determine a strong turnpike policy. The algorithm is simple, and it terminates after the a number of steps equal to the turnpike horizon. Some remarks on the existence of rolling horizontal plans and forecast horizons are also given. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 775–790, 1997