-

This paper considers the problem of
dynamic multi-item single level Capacitated Lot Sizing Problem with Setup Carry-over, which is abbreviated as CLSPSc. First the formulation of CLSPSC is presented as a Mixed Integer Programming (MIP) problem. Then two new heuristics for CLSPSC, consist of
three elements of lot size determination, feasibility conditions and setup carry-over
determination are described. Based on the algorithms a computer program in C++ is prepared for the algorithms. The computational results demonstrate that the heuristic algorithms are efficient to gain
good quality solutions with high speed. The computational efficiency makes it possible to solve realistically large problem instances routinely on a personal computer.