Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Simulated Annealing: use of new tool in bin packing
Annals of Operations Research
A tabu search experience in production scheduling
Annals of Operations Research - Special issue on Tabu search
Path assignment for call routing: an application of tabu search
Annals of Operations Research - Special issue on Tabu search
Applying tabu search with influential diversification to multiprocessor scheduling
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Meta-Heuristics: Theory and Applications
Meta-Heuristics: Theory and Applications
Tabu Search
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
Multiple sequence alignment using tabu search
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Minimizing Labor Requirements in a Periodic Vehicle Loading Problem
Computational Optimization and Applications
A composite algorithm for multiprocessor scheduling
Journal of Heuristics
Information Sciences: an International Journal
| Hi-index | 0.00 |
Using a simple multiprocessor scheduling problem as a vehicle,we explore the behavior of tabu search algorithms using differenttabu, local search and list management strategies. We found thatrandom blocking of the tail of the tabu list always improvedperformance; but that the use of frequency-based penalties todiscourage frequently selected moves did not. Hash codingwithout conflict resolution was an effective way to represent solutions on the tabu list. We also found that the most effective length of the tabu list depended onfeatures of the algorithm being used, but not on the size andcomplexity of the problem being solved. The best combination offeatures included random blocking of the tabu list, tasks astabus and a greedy local search. An algorithm using thesefeatures was found to outperform a recently published algorithmsolving a similar problem.