Effective and efficient solution of some lot-sizing problems by tabu search

The paper demonstrates that the power of tabu search enables it to play a useful role in the solution of difficult planning and scheduling problems. The solution of two such problems; namely, the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs and the multi-item, single-level, capacitated, dynamic lot-sizing problem, is presented