Optimised Search Heuristic Combining Valid Inequalities and Tabu Search

Authors:
Susana Fernandes;Helena R. Lourenço
Affiliations:
Universidade do Algarve, Faro, Portugal;Univertitat Pompeu Fabra, Barcelona, Spain
Venue:
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Year:
2008

Citing 9
Cited 0

The shifting bottleneck procedure for job shop scheduling

Management Science
An algorithm for solving the job-shop problem

Management Science
New search spaces for sequencing problems with application to job shop scheduling

Management Science
A fast taboo search algorithm for the job shop problem

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Exploring relaxation induced neighborhoods to improve MIP solutions

Mathematical Programming: Series A and B
An Advanced Tabu Search Algorithm for the Job Shop Problem

Journal of Scheduling
A GRASP and branch-and-bound metaheuristic for the job-shop scheduling

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

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.