Sports tournament scheduling to determine the required number of venues subject to the minimum timeslots under given formats

• We study a two-phase tournament commonly for non-professional sports.
• The objective is to determine the number of venues subject to the least timeslots.
• A diagonal symmetric matrix allows of generating multiple feasible round robin schedules is provided.

We studied a two-phase, preliminary and finals, tournament, which commonly adopted for non-professional sports. The round robin tournament in divisions is played in the preliminary phase, followed by one of the three variants, namely single elimination, double elimination, and round robin in the finals phase. The objective is to determine the required number of venues (tables or courts) subject to the least timeslots under the given format. We used a diagonal symmetric matrix to pair teams to games and to schedule games in timeslots for the round robin tournament. For the preliminary phase, we proposed a procedure to find the number of divisions and the number of teams in each division that minimize the total number of games and timeslots accordingly. For the finals phase, we determined the number of venues required in the least timeslots. We then formulated a constraint programming model based on the diagonal symmetric matrix for the round robin tournament. Finally, we provided suggestions for choosing the appropriate competition format.