Hybrid tabu search for lot sizing problems

Authors:
João Pedro Pedroso;Mikio Kubo
Affiliations:
DCC-FC and LIACC, Universidade do Porto, Porto, Portugal;Supply Chain Optimization Lab., Tokyo University of Marine Science and Technology, Tokyo, Japan
Venue:
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
Year:
2005

Citing 2
Cited 1

Tabu Search

Tabu Search
A General Heuristic for Production Planning Problems

INFORMS Journal on Computing

Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.