Abstract (EN):
This paper presents a hybrid tabu search strategy for lot sizing problems. This strategy allows the exploitation of the quality of the well-known relax-and-fix heuristic, inside a tabu search framework which enforces diversity. The computational results show an advantage of this strategy when compared to a version of the relax-and-fix heuristic and to time constrained branch-and-bound.
Language:
English
Type (Professor's evaluation):
Scientific
Contact:
jpp@ncc.up.pt; kubo@e.kaiyodai.ac.jp
No. of pages:
12