Track: Operations Research
Abstract
We study a sports scheduling problem where the entire fixture of a soccer season in Turkey must be scheduled by taking into account a variety of constraints. We model the problem as an integer program; because of the computational intractability, we develop a heuristic algorithm for obtaining a suboptimal solution. Differing from the earlier models, our model minimizes the assignment of matches where a team plays against strong teams consecutively. We compare the performance of our heuristic against the existing solution and demonstrate numerically that our heuristic performs significantly better than the current solution.