Scheduling Asynchronous Round-Robin Tournaments
Preprint
Abstract
We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known "circle design" performs well with respect to all three measures when the number of teams is even, but not when the number of teams is odd. We propose a different schedule that performs optimally with respect to all measures when the number of teams is odd.Keywords
All Related Versions
- Version 1, 2018-04-11, ArXiv
- Published version: Operations Research Letters, 44 (1), 96.
This publication has 11 references indexed in Scilit:
- Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaksOperations Research Letters, 2013
- Constructing fair round robin tournaments with a minimum number of breaksOperations Research Letters, 2010
- Constructing fair sports league schedules with regard to strength groupsDiscrete Applied Mathematics, 2010
- Scheduling non-professional table-tennis leaguesEuropean Journal of Operational Research, 2010
- Combinatorial properties of strength groups in round robin tournamentsEuropean Journal of Operational Research, 2009
- Round robin scheduling – a surveyEuropean Journal of Operational Research, 2008
- Scheduling sports tournaments on a single court minimizing waiting timesOperations Research Letters, 2008
- Memetic Algorithm timetabling for non-commercial sport leaguesEuropean Journal of Operational Research, 2004
- Combinatorial Designs and Tournaments1997
- Scheduling sports competitions with a given distribution of timesDiscrete Applied Mathematics, 1988