Capacitated Lotsizing Problem with Setup Carry-over (CLSP-L)
This is a big-bucket lotsizing problem with the same assumptions as the CLSP. However, if a product is the last one produced in a period and the first one produced in the following period, then no new setup occurs. The setup is carried over.
» See also: CLSP - Multi-item capacitated dynamic lotsizing problem