Technical note: Tabu search heuristic for a loading problem in flexible manufacturing systems

This note presents an improvement algorithm for a flexible manufacturing system loading problem. The tabu meta-heuristic is used in conjunction with this algorithm. Previous authors have proposed integer programming. Lagrangean relaxation heuristic, and branch and bound search to solve this problem. Computational comparison between the improvement algorithm and the branch and bound search algorithm is presented.