Abstract: Constructing Optimal Schedules for certain Tournaments using Tabu Search

In this paper we describe a scheduling problem for certain types of tournaments. It is formulated as a discrete minimization problem. Using a tabu search method we solve various problem instances of different size and complexity. The influence of the tabu list size on the performance of the algorithm is studied. Tabu search is also compared with previous optimization techniques, which are available in related literature.