A branching scheme for minimum cost tournaments with regard to real-world constraints
Single round robin tournaments are a well-known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated with each possible match. Moreover, stadium availability, fixed matches, and regions’ capacities are taken into account. The goal is to find the minimum cost tournament among those having the minimum number of breaks and being feasible with regard to these additional constraints. A branching scheme is developed where branching is done by fixing a break for a team. Thus, the focus is on identifying breaks leading to an infeasible home away pattern set in order to avoid the resulting infeasible subtrees of a branch and bound tree.
Keywordssports league scheduling round robin tournaments home-away-pattern set break stadium region branch-and-bound
- Achterberg T, Koch T and Martin A (2005). Branching rules revisited. Eur J Opl Res 33: 42–54.Google Scholar
- Briskorn D and Drexl A (2007). Branching based on home–away–pattern sets. In: Waldmann K-H and Stocker UM (eds). Operations Research Proceedings 2006–Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Karlsruhe, September 6th–8th 2006. Springer: Berlin, Germany, pp 523–528.Google Scholar
- Briskorn D, Drexl A and Spieksma FCR (2010). Round robin tournaments and three index assignment. 4OR 8 (4): 365–374.Google Scholar
- Brucker P and Knust S (2006). Complex Scheduling. Springer: Berlin.Google Scholar
- Horbach A, Bartsch T and Briskorn D (2010). Optimally scheduling real world sports leagues by reduction to SAT. J Scheduling, DOI 10.1007/S10951-010-0194-9.Google Scholar
- Knust S (2010). Classification of literature on sports scheduling. http://www.inf.uos.de/knust/sportlit_class/. 10 September 2010.
- Miyashiro R, Iwasaki H and Matsui T (2003). Characterizing feasible pattern sets with a minimum number of breaks. In: Burke E and de Causmaecker P (eds). The 4th International Conference on the Practice and Theory of Automated Timetabling, Selected Revised Papers. Lecture Notes in Computer Science, Vol. 2740, Springer: Berlin, Germany, pp 78–99.Google Scholar
- Nurmi K (2010). Sports scheduling problem—Terminology, problem model, benchmark instances, best solutions. http://www.bit.spt.fi/cimmo.nurmi/ssp.htm, 10 September 2010.
- Nurmi K, Goossens D, Bartsch T, Bonomo F, Briskorn D, Duran G, Kyngs J, Marenco J, Ribeiro C, Spieksma F, Urrutia S and Wolf R (2010). A framework for a highly constrained sports scheduling problem. In: Ao S-I, Katagiri H, Xu L and Chan AH-S (eds.) Proceedings of the International MultiConference of Engineers and Computer Scientists 2010. Vol III. Newswood Limited: Hong-Kong, pp 1991–1997.Google Scholar
- Ribeiro CC and Urrutia S (2007). Scheduling the Brazilian soccer tournament with fairness and broadcast objectives. Lect Notes Comp Sci 3867: 149–159.Google Scholar
- Siek JG, Lee L-Q and Lumsdaine A (2001). The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Professional: Amsterdam.Google Scholar