A Branch-and-Price Algorithm for Scheduling Sport Leagues
Round robin tournaments (RRTs) cover a huge variety of different types of sports league schedules arising in practice. The focus in this paper is on single RRTs where scheduling is temporally constrained, which means that matches have to be scheduled in a given minimum number of periods. We consider a set T of n teams. If n is odd, we easily can add a dummy team and, hence, we can assume, that n is even without loss of generality. In a single RRT, each team plays exactly once against each other team, either at home or away. Furthermore, a team i⋲T has to play exactly once in each period and, hence, we have a set P of n−1 periods altogether.
KeywordsFeasible Solution Column Generation Master Problem Current Node Depth First Search
Unable to display preview. Download preview PDF.
- Bartsch T (2001). Sportligaplanung — Ein Decision Support System zur Spielplanerstellung. Deutscher Universita¨tsverlag: Wiesbaden (in German).Google Scholar
- 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.Google Scholar
- Briskorn D and Drexl A (2007). Branching based on home-away-pattern sets. In: GOR Proceedings 2006. Springer: Berlin, Germany.Google Scholar
- Briskorn D, Drexl A and Spieksma FCR (2006). Round robin tournaments and three index assignment. Working Paper.Google Scholar
- Brucker P and Knust S (2006). Complex Scheduling. Springer: Berlin.Google Scholar
- Kendall G (2007). Scheduling English football fixtures over holiday periods. J Opl Res Soc. Advance online publication, (doi: 10.1057/palgrave.jors.2602382).Google Scholar
- Kirkman TP (1847). On a problem in combinations. Cambridge Dublin Math J 2: 191–204.Google Scholar
- Lasdon LS (1970). Optimization theory for large systems. North-Holland: Amsterdam, The Netherlands.Google Scholar
- Lowerre BT (1976). The HARPY speech recognition system. Ph.D thesis, Carnegie-Mellon University, USA.Google Scholar
- Miyashiro R, Iwasaki H and Matsui T (2003). Characterizing feasible pattern sets with a minimum number of breaks. In: Burke E., 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.CrossRefGoogle Scholar
- Rubin S (1978). The ARGOS image understanding system. Ph.D thesis, Carnegie-Mellon University, USA.Google Scholar
- 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.Google Scholar