Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm

There are significant amount of literature on the capacitated lot sizing problem(CLSP) with different levels and approaches. In this article, immune complement algorithm (ICA) was discussed in scheduling optimization of CLSP under the condition of single level, single machine. The affinity function was the total cost which including order, inventory carrying and labor costs. Complement individual was represented by binary to determine order sequence and lot sizing. Experimentation performed with 5 production 6 period indicated that ICA had the characteristics of high speed of convergence, less generations besides approaching best solution, and it could be used in CLSP on medium scale.