We analyze the dynamic lot-sizing model in which the cost of a setup depends on the number of setups that have occurred prior to it. This arises, for example, when there exist learning effects in setups. Our model is more general than most learning models in the literature since it allows the...

In most dynamic planning problems, one observes that an optimal decision at any given stage depends on limited information, i.e., information pertaining to a limited set of adjacent or nearby stages. This holds in particular for planning problems over time, where an optimal decision in a given...

This paper is concerned with the general dynamic lot size model, or (generalized) Wagner-Whitin model. Let n denote the number of periods into which the planning horizon is divided. We describe a simple forward algorithm which solves the general model in 0(n log n) time and 0(n) space, as...