This paper presents a dynamic programming algorithm for simultaneous determination of production batch sizes in an assembly network and distribution batch sizes in a conjoined distribution ("arborescent") network. The objective is to minimize average cost per period over an infinite horizon....

We consider the situation of a single item having a deterministic, time-varying demand pattern. Production lot sizes, so as to minimize the total of setup and carrying costs, are to be determined subject to production capacity restrictions that can vary with time. Two important theorems...