Generic application of tabu search methods to manufacturing problems

We exemplify the generic application of various tabu search methods to different sequencing problems from the field of production planning. Our approach includes the emphasis on implementing neighborhood search based meta-heuristics, especially tabu search methods, in a generic and adaptable way, which facilitates an efficient reuse of these software components. We briefly describe a corresponding framework for heuristic search including the application to different NP-hard manufacturing problems