Characterizing Feasible Pattern Sets with a Minimum Number of Breaks
- 942 Downloads
In sports timetabling, creating an appropriate timetable for a round-robin tournament with home–away assignment is a significant problem. To solve this problem, we need to construct home–away assignment that can be completed into a timetable; such assignment is called a feasible pattern set. Although finding feasible pattern sets is at the heart of many timetabling algorithms, good characterization of feasible pattern sets is not known yet. In this paper, we consider the feasibility of pattern sets, and propose a new necessary condition for feasible pattern sets. In the case of a pattern set with a minimum number of breaks, we prove a theorem leading a polynomial-time algorithm to check whether a given pattern set satisfies the necessary condition. Computational experiment shows that, when the number of teams is less than or equal to 26, the proposed condition characterizes feasible pattern sets with a minimum number of breaks.
KeywordsComputational Experiment Integer Programming Problem Black Vertex Partial Assignment Complement Pair
Unable to display preview. Download preview PDF.
- 7.Ferland, J.A., Fleurent, C.: Computer Aided Scheduling for a Sport League. INFOR 29, 14–25 (1991)Google Scholar
- 9.ILOG: ILOG CPLEX 7.0 User’s Manual. ILOG, Gentilly (2000)Google Scholar
- 10.Miyashiro, R., Matsui, T.: Note on Equitable Round-Robin Tournaments. In: Proc. 6th KOREA–JAPAN Joint Workshop on Algorithms and Computation, pp. 135–140 (2001)Google Scholar
- 11.Miyashiro, R., Matsui, T.: Notes on Equitable Round-Robin Tournaments. IEICE Trans. Fund. Electron. Commun. Comput. Sci. E85-A, 1006–1010 (2002)Google Scholar
- 19.Wright, M.: Timetabling County Cricket Fixtures Using a Form of Tabu Search. J. Oper. Res. Soc. 45, 758–770 (1994)Google Scholar