NOTE - DYNAMIC LOT-SIZING FOR A FINITE RATE INPUT PROCESS

The basic single-product dynamic lot-sizing problem involves determini ng the optimal batch production schedule to meet a deterministic, disc rete-in-time, varying demand pattern subject to linear setup and stock holding costs. The most widely known procedure for deriving the optima l solution is the Wagner-Whitin algorithm, although many other approac hes have subsequently been developed for tackling the same problem. Th e objective of this note is to show how these procedures can readily b e adapted when the input is a finite rate production process. (C) 1997 John Wiley & Sons, Inc.