Scheduling in sports: An annotated bibliography

G Kendall, S Knust, CC Ribeiro, S Urrutia - Computers & Operations …, 2010 - Elsevier
Sports have worldwide appeal. Professional sport leagues involve significant investments in
players. Events such as the Olympics Games, the Football World Cup and the major golf and …

Round robin scheduling–a survey

RV Rasmussen, MA Trick - European Journal of Operational Research, 2008 - Elsevier
This paper presents a comprehensive survey on the literature considering round robin
tournaments. The terminology used within the area has been modified over time and today it …

The traveling tournament problem description and benchmarks

K Easton, G Nemhauser, M Trick - … CP 2001 Paphos, Cyprus, November 26 …, 2001 - Springer
Abstract The Traveling Tournament Problem is a sports timetabling problem that abstracts
two issues in creating timetables: home/away pattern feasibility and team travel. Instances of …

A simulated annealing and hill-climbing algorithm for the traveling tournament problem

A Lim, B Rodrigues, X Zhang - European Journal of Operational Research, 2006 - Elsevier
The Traveling Tournament Problem (TTP)[E. Easton, G. Nemhauser, M. Trick, The traveling
tournament problem description and benchmarks, in: Proceedings of the 7th International …

A schedule-then-break approach to sports timetabling

MA Trick - International conference on the practice and theory of …, 2000 - Springer
Sports timetabling algorithms need to be able to handle a wide varietyof requirements. We
present a two-phase method in which the first phase is to schedule the teams ignoring …

Global constraints for round robin tournament scheduling

M Henz, T Müller, S Thiel - European Journal of Operational Research, 2004 - Elsevier
In the presence of side-constraints and optimization criteria, round robin tournament
problems are hard combinatorial problems, commonly tackled with tree search and branch …

A Benders approach for the constrained minimum break problem

RV Rasmussen, MA Trick - European Journal of Operational Research, 2007 - Elsevier
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule
with a minimal number of breaks. Both mirrored and non-mirrored schedules with and …

[图书][B] Programming constraint services: High-level programming of standard and new constraint services

C Schulte - 2002 - Springer
13. Implementing Spaces Page 1 13. Implementing Spaces This chapter discusses the
implementation of computation spaces. The implementation of Oz Light is extended by nodes …

Semidefinite programming based approaches to the break minimization problem

R Miyashiro, T Matsui - Computers & Operations Research, 2006 - Elsevier
This paper considers the break minimization problem in sports timetabling. The problem is to
find, under a given timetable of a round-robin tournament, a home-away assignment that …

The traveling tournament problem with predefined venues

RA Melo, S Urrutia, CC Ribeiro - Journal of Scheduling, 2009 - Springer
Sports scheduling is a very attractive application area not only because of the interesting
mathematical structures of the problems, but also due to their importance in practice and to …