Abstract
We examine round robin tournaments with m teams and m rounds, for m ≥ 3, with the property that every team plays no game in one round and exactly one game in each of the remaining m − 1 rounds. We show that for every such m there exists a unique schedule in which no team plays two consecutive home or away games.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
de Werra, D. (1981) Scheduling in sports. In Studies on Graphs and Discrete Programming, North-Holland, Amsterdam, pp. 381–395.
Dinitz, J. and Froncek, D. (2000) Scheduling the XFL. Congressus Numerantium, 147:5–15.
Finizio, N. J. (1993) Tournament designs balanced with respect to several bias categories. Bulletin ICA, 9:69–95.
Griggs, T. and Rosa, A. (1996) A tour of European soccer schedules, or Testing the popularity of GK 2n. Bulletin ICA, 18:65–68.
Henz, M. (1999) Constraint-based round robin tournament planning. In Proceedings of the International Conference on Logic Programming, MIT Press, Cambridge, MA, pp. 545–557.
Henz, M. (2001) Scheduling a major college basketball conference—revisited. Operations Research, 49(1).
Henz, M., Müller, T. and Thiel, S. (2003) Global constraints for round robin tournament scheduling, European Journal of Operations Research, 153:92–101.
Nemhauser, G. and Trick, M. A. (1998) Scheduling a major college basketball conference. Operations Research, 46:1–8.
Schaerf, A. (1999) Scheduling sports tournaments using constraint logic programming. Constraints, 4:43–65.
Schreuder, J. A. M. (1980) Construction timetables for sports competitions. In Combinatorial Optimization II (Conference Proceedings, University of East Anglia, 1979), Mathematical Programming Study, 13:58–67.
Schreuder, J. A. M. (1992) Combinatorial aspects of construction of competition Dutch professional football leagues. Discrete Applied Mathematics, 35:301–312.
Straley, T. H. (1983) Scheduling designs for a league tournament. Ars Combinatoria, 15:193–200.
Trick, M. A. (2000) A Schedule-then-break approach to sports timetabling. In Practice and Theory of Automated Timetabling III, E. Burke and W. Erben (Eds.), Lecture Notes in Computer Science, Vol. 2079, Springer, Berlin, pp. 242–253.
UEFA (2004) www.uefa.com/uefa/members/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Fronček, D., Meszka, M. (2005). Round Robin Tournaments with One Bye and No Breaks in Home-Away Patterns Are Unique. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds) Multidisciplinary Scheduling: Theory and Applications. Springer, Boston, MA. https://doi.org/10.1007/0-387-27744-7_16
Download citation
DOI: https://doi.org/10.1007/0-387-27744-7_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25266-7
Online ISBN: 978-0-387-27744-8
eBook Packages: Business and EconomicsBusiness and Management (R0)