of heuristics based on the behaviour of nature ants. These algorithms have been used to solve many combinatorial … optimization problems and have been known to outperform other popular heuristics such as Genetic Algorithms. Therefore, we believe …

an appropriate value for this parameter. The use of dominance rules to improve the solutions obtained by these heuristics …

In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and … tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and … recovering algorithms. We consider three dispatching heuristics as evaluation functions, in order to analyse the effect of …

computational results show that using better rules indeed improves the performance of the beam search heuristics. The detailed …

, and no machine idle time. We propose several dispatching heuristics, and analyse their performance on a wide range of … instances. The heuristics include simple scheduling rules, as well as a procedure that takes advantage of the strengths of these … were performed to determine appropriate values for the parameters required by some of the heuristics. The computational …

new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules. Both … solutions obtained by the heuristics. The computational results show that the function-based versions of the heuristics …

search and dispatch rule heuristics. Filtering procedures using both priority evaluation functions and problem …

filtered and recovering beam search heuristics. Extensive preliminary tests were performed to determine appropriate values for …