Remarks on: 'some extensions of the discrete lotsizing and scheduling problem'

An account of complexity analysis is given in the context of lotsizing and scheduling problems. Three important topics are covered including the rapid growth of research on problems that combine lotsizing and scheduling, the potential of such problems for requiring much less information to represent an instance, and the evidence that the literature is unclear on this point.