Towards practical `neural' computation for combinatorial optimization problems
AIP Conference Proceedings 151 on Neural Networks for Computing
A survey of algorithms for the single machine total weighted tardiness scheduling problem
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Computers and Operations Research
Improved Large-Step Markov Chain Variants for the Symmetric TSP
Journal of Heuristics
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Ant Colony Optimization for the Total Weighted Tardiness Problem
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
INFORMS Journal on Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
INFORMS Journal on Computing
Evaluating las vegas algorithms: pitfalls and remedies
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Ant Algorithms Solve Difficult Optimization Problems
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Block approach: tabu search algorithm for single machine total weighted tardiness problem
Computers and Industrial Engineering
Computers and Operations Research
Block approach-tabu search algorithm for single machine total weighted tardiness problem
Computers and Industrial Engineering
Fast neighborhood search for the single machine earliness-tardiness scheduling problem
Computers and Operations Research
Stochastic local search for multiprocessor scheduling for minimum total tardiness
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Grid jobs scheduling: The Alienated Ant Algorithm solution
Multiagent and Grid Systems
A GRASP-based approach to the generalized minimum spanning tree problem
Expert Systems with Applications: An International Journal
Fast ejection chain algorithms for vehicle routing with time windows
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Computers and Operations Research
A bio-inspired distributed algorithm to improve scheduling performance of multi-broker grids
Natural Computing: an international journal
Hi-index | 0.00 |
In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently proposed iterated dynasearch approach, which was shown to be a very effective ILS algorithm for this problem. In this paper we systematically configure an ILS algorithms by optimizing the single procedures part of ILS and optimizing their interaction. We come up with a highly effective ILS approach, which outperforms our implementation of the iterated dynasearch algorithm on the hardest benchmark instances.