Simulated Annealing Heuristic for Lot-Sizing Problem

1 Eppen G D,Martin R K. Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations Research,1987,35(6):832~848 2. Hindi K S. Solving the CLSP by a tabu search heuristic. J Opl Res Soc, 1996, 47(1):151~161 3. Eisenhut P S. A dynamic lot sizing algorithm with capacity constraints. AIIE Transactions,1975, 7(2):170~176 4. Bertsekas D P, Tseng P. Relaxation methods for minimum cost ordinary and generalized network flow problems. Operations Research, 1988, 36(1):93~114 5. Glove F,Laguna　M. Modern heuristic techniques for combinatorial problems.Oxford:Blackwell Scientific Publishing, 1993 6. 刘 勇,康立山,陈毓屏.非数值并行算法——模拟退火算法.北京:科学出版社,1995 7. Lambrecht M R, Vanderveken H. Heuristic procedures for the single operation, multi-item loading problem. AIIE Transactions, 1979, 11(4):319~326