Abstract
A single round robin tournament can be described as a league of a set T of n teams (n even) to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period resulting in a set P of n−1 periods. Matches are carried out at one of the stadiums of both opponents. A team playing twice at home or twice away in two consecutive periods is said to have a break in the latter of both periods. There is a vast field of requests arising in real-world problems. For example, the number of breaks is to be minimized due to fairness reasons. It is well known that at least n−2 breaks must occur. We focus on schedules having the minimum number of breaks. Costs corresponding to each possible match are given and the objective is to minimize the sum of cost of arranged matches. Then, sports league scheduling can be seen as a hard combinatorial optimization problem. We develop a branch-and-price approach in order to find optimal solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anagnostopoulos A, Michel L, van Hentenryck P and Vergados Y (2006). A simulated annealing approach to the travelling tournament problem. J Scheduling 9: 177–193.
Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP and Vance PH (1996). Branch-and-price: Column generation for solving huge integer programs. Opns Res 46: 316–329.
Bartsch T (2001). Sportligaplanung – Ein Decision Support System zur Spielplanerstellung. Deutscher Universitätsverlag: Wiesbaden (in German).
Bartsch T, Drexl A and Kröger S (2006). Scheduling the professional soccer leagues of Austria and Germany. Comput Opns Res 33: 1907–1937.
Briskorn D and Drexl A (2006). Scheduling sports leagues using branch-and-price. In: Burke E. and Rudova H. (eds). Proceedings of the Sixth International Conference on the Practice and Theory of Automated Timetabling. Springer: Berlin, Germany, pp. 367–369.
Briskorn D and Drexl A (2007). Branching based on home-away-pattern sets. In: GOR Proceedings 2006. Springer: Berlin, Germany.
Briskorn D, Drexl A and Spieksma FCR (2006). Round robin tournaments and three index assignment. Working Paper.
Brucker P and Knust S (2006). Complex Scheduling. Springer: Berlin.
Cook W and Rohe A (1999). Computing minimum-weight perfect matchings. INFORMS J Comput 11: 138–148.
de Werra D (1980). Geography, games and graphs. Discrete Appl Math 2: 327–337.
de Werra D (1981). Scheduling in sports. In: Hansen P. (ed). Studies on Graphs and Discrete Programming. North-Holland: Amsterdam, The Netherlands, pp. 381–395.
de Werra D (1982). Minimizing irregularities in sports schedules using graph theory. Discrete Appl Math 4: 217–226.
de Werra D (1985a). On the multiplication of divisions: The use of graphs for sports scheduling. Networks 15: 125–136.
de Werra D (1985b). Some models of graphs for scheduling sports competitions. Discrete Appl Math 21: 47–65.
de Werra D, Ekim T and Raess C (2006). Construction of sports schedules with multiple venues. Discrete Appl Math 154: 47–58.
Drexl A and Knust S (2007). Sports league scheduling: graph- and resource-based models. Omega 35: 465–471.
Easton K, Nemhauser G and Trick M (2001). The travelling tournament problem: Description and benchmarks. In: Walsh T. (ed). Proceedings of Principles and Practice of Constraint Programming – CP 2001. Lecture Notes in Computer Science, vol. 2239. Springer: Berlin, pp 580–585.
Edmonds J (1965). Maximum matching and a polyhedron with (0,1) vertices. J Res Natl Bureau Standards Sect B 69(B): 125–130.
Gilmore PC and Gomory RE (1961). A linear programming approach to the cutting-stock problem. Opns Res 9: 849–859.
Kendall G (2007). Scheduling English football fixtures over holiday periods. J Opl Res Soc., Advance online publication, (doi: 10.1057/palgrave.jors.2602382).
Kirkman TP (1847). On a problem in combinations. Cambridge Dublin Math J 2: 191–204.
Kuhn HW (1955). The Hungarian method for the assignment problem. Naval Res Logistics Quart 2: 83–97.
Lasdon LS (1970). Optimization theory for large systems. North-Holland: Amsterdam, The Netherlands.
Lowerre BT (1976). The HARPY speech recognition system. Ph.D thesis, Carnegie-Mellon University, USA.
Mehrotra A and Trick MA (1996). A column generation approach for graph coloring. INFORMS J Comput 8: 344–354.
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). Proceedings of the Fourth International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science Vol. 2740. Springer: Berlin, Germany, pp. 78–99.
Rasmussen RV (2008). Scheduling a triple round robin tournament for the best Danish soccer league. Eur J Opl Res 185, 795–810.
Rasmussen RV and Trick MA (2007). A benders approach for the constrained minimum break problem. Eur J Opl Res 177: 198–213.
Rubin S (1978). The ARGOS image understanding system. Ph.D thesis, Carnegie-Mellon University, USA.
Ryan DM and Foster BA (1981). An integer programming approach to scheduling. In: Wren A. (ed). Computer scheduling of public transport. urban passenger vehicle and crew scheduling. North-Holland: Amsterdam, The Netherlands, pp. 269–280.
Schreuder JAM (1980). Constructing timetables for sport competitions. Math Programming Study 13: 58–67.
Schreuder JAM (1992). Combinatorial aspects of construction of competition dutch professional football leagues. Discrete Appl Math 35: 301–312.
Urrutia S and Ribeiro CC (2004). Minimizing travels by maximizing breaks in round robin tournament schedules. Electronic Notes Discrete Math 18(C): 227–231.
Vance PH, Barnhart C, Johnson EL and Nemhauser GL (1994). Solving binary cutting stock problems by column generation and branch-and-bound. Comput Optim Appl 3: 111–130.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Briskorn, D., Drexl, A. A branch-and-price algorithm for scheduling sport leagues. J Oper Res Soc 60, 84–93 (2009). https://doi.org/10.1057/palgrave.jors.2602515
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602515