Capacitated lot sizing with constant capacity (CLS-C)

Catalogue of combinatorial problems · Lot sizing problems · Catalogue (PDF)

Definition 1: Capacitated lot sizing with constant capacity

The CLS in which the capacity is the same in all periods, \(cap_t=C\) for all \(t\in T\).

What the course does on this problem

Technique	Where
Definition	This page
Dynamic programming	Ch. 26 «DP for the capacitated lot sizing problem»