Capacitated Lot Sizing Problem with Production Carryover and Setup Crossover Across Periods (CLSP:PCSC): Mathematical Model 1 (MM1) and a Heuristic for Process Industries
The capacitated lot sizing problem (CLSP) is a lot sizing model in which the production of multiple products is allowed within a time period on a single machine, with a condition that the entire demand for a product within that period should be met from the production in that period and/or the inventory carried from the previous periods, without any backorders or lost sales. Finding a minimum cost production plan that satisfies all the demand requirements without exceeding the capacity limits of a period is the main objective of the CLSP.
- Caserta, M., A. Ramirez, and S. Voß. 2010. A math-heuristic for the multi-level capacitated lot sizing problem with carryover. Applications of evolutionary computation, 462–471. Springer.Google Scholar
- Caserta, M., A. Ramirez, S. Voß, and R. Moreno. 2009. A hybrid algorithm for the multi level capacitated lot sizing problem with setup carry-over. Logistik management, 123–138. Springer.Google Scholar
- Haase, K. and A. Drexl. 1994. Capacitated lot-sizing with linked production quantities of adjacent periods. Operations Research’93, 212–215. Springer.Google Scholar
- Sox, C. R. and Y. Gao 1999. The capacitated lot sizing problem with setup carry-over. IIE Transactions 31(2): 173–181.Google Scholar