Optimised search heuristic combining valid inequalities and tabu search

Abstract

This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the valid inequalities are used to guide the reconstruction of a complete solution. An application of the new method to the Job-Shop Scheduling problem is presented.Optimised Search Heuristic, Tabu Search, GRASP, Valid Inequalities, Job Shop Scheduling