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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number
1100.
Find related papers by JEL classification: C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis M11 - Business Administration and Business Economics; Marketing; Accounting - - Business Administration - - - Production Management
This paper has been announced in the following NEP Reports:
Did you know? All full texts are decentralized with the publishers, none reside on this server, thus making it possible to offer this service for free to all parties.