Abstract: Wagner-Whitin(WW)algorithm is a classical optimization heuristic algorithm for lot-sizing planning (LSP)problem. It can provide the best production volumes of a product effectively for medium- and small-sized problems. Randomized cumulative WW (RCWW) algorithm is a modified WW algorithm,which is very suitable for solving LSP problem with general structure and multiple levels. The performance of RCWW algorithm was proved before. Based on the executive idea of RCWW algorithm, this paper adopted C programming language to implement RCWW algorithm. Through computation on LSP problems with general structure, the effects of RCWW algorithm were verified. Also, the errors from literature were found out and our understanding on RCWW algorithm was proved to be correct.

Key words: Wagner-Whitin algorithm, Lot sizing planning problem, Randomized cumulative, General structure, Multiple 1evels,Intelligcnt optimization algorithm