Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(11)
Combinatorial Optimization
Constraint Programming
Graph Theory
Hybrid Method
Integer Program
Literature Survey
Operations Research
Scheduling Problem
Scheduling Theory
Round Robin
Traveling Tournament Problem
Subscribe
Academic
Publications
Scheduling Single Round Robin Tournaments with Fixed Venues
Scheduling Single Round Robin Tournaments with Fixed Venues,Rafael A. Melo,Sebastian Urrutia,Celso C. Ribeiro
Edit
Scheduling Single Round Robin Tournaments with Fixed Venues
(
Citations: 2
)
BibTex

RIS

RefWorks
Download
Rafael A. Melo
,
Sebastian Urrutia
,
Celso C. Ribeiro
Sports scheduling is a very attractive application area due to the importance of the problems in practice and to their interesting mathematical structure. We introduce a new problem with practical applications, consisting in scheduling a compact single roundrobin tournament with fixed venue assignments for each game. Two integer programming formulations are proposed and compared. Comparative numerical results are presented. 1 Problem statement The field of sports scheduling has been attracting the attention of an increasing number of re searchers in multidisciplinary areas such as operations research, scheduling theory, constraint pro gramming, graph theory, combinatorial optimization, and applied mathematics. Particular im portance is given to
round robin
scheduling problems in which each team is associated with a particular venue, due to their relevance in practice and to their interesting mathematical structure. The diculty of the problems in the field leads to the use of a number of approaches, includ ing integer programming (10, 15),
constraint programming
(6), hybrid methods (3), and heuristic techniques (1, 14). We refer to (4, 11) for literature surveys. In
round robin
tournaments, every team face each other a fixed number of times in a given number of rounds. Every team face each other exactly once in a single
round robin
(SRR) and twice in a double
round robin
(DRR). If the number of rounds is minimum and every team plays exactly one game in every round, then the tournament is said to be compact. Each team has its own venue at its home city. Each game is played at the venue of one of the two teams in confrontation. The team that plays at its own venue is called the home team and is said to play a home game, while the other is called the away team and is said to play an away game. A schedule must not only determine in which round each game will be played, but also at which venue. The problem of scheduling
round robin
tournaments is often divided into two subproblems. The construction of the timetable consists in determining the round in which each game will be played. The homeaway pattern (HAP) set determines in which condition (home or away) each team plays in each round. The timetable and the homeaway pattern set determine the tournament schedule. Some
round robin
scheduling problems consider both the construction of the timetable and of the homeaway pattern set. As an example, the
traveling tournament problem
(TTP) (5) calls for a schedule minimizing the total distance traveled by the teams. However, either the timetable or the HAP set of the schedule may be fixed and known before hand in some situations. In the first case, the timetable is given and the problem consists in finding
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.mistaconference.org
)
Citation Context
(1)
...Successful algorithms for sports scheduling include tabu search [12][14], simulated annealing [15][17], graph coloring and branch and bound [18], constrained programming [19][22], integer linear programming [23] [
25
] and hybrid integer/constrained programming [8],[26]...
Jari Kyngäs
,
et al.
Scheduling the finnish major ice hockey league
References
(15)
A simulated annealing approach to the traveling tournament problem
(
Citations: 42
)
Aris Anagnostopoulos
,
Laurent Michel
,
Pascal Van Hentenryck
,
Yannis Vergados
Journal:
Journal of Scheduling  SCHEDULING
, vol. 9, no. 2, pp. 177193, 2006
Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach
(
Citations: 48
)
Kelly Easton
,
George L. Nemhauser
,
Michael A. Trick
Conference:
Practice and Theory of Automated Timetabling  PATAT
, pp. 100112, 2002
The Traveling Tournament Problem Description and Benchmarks
(
Citations: 70
)
Kelly Easton
,
George L. Nemhauser
,
Michael A. Trick
Conference:
Principles and Practice of Constraint Programming  CP
, pp. 580584, 2001
Constraintbased Round Robin Tournament Planning
(
Citations: 27
)
Martin Henz
Conference:
International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming  ICLP(JICSLP)
, pp. 545557, 1999
Balanced homeaway assignments
(
Citations: 7
)
Sigrid Knust
,
Michael Von Thaden
Journal:
Discrete Optimization
, vol. 3, no. 4, pp. 354365, 2006
Sort by:
Citations
(2)
Scheduling the finnish major ice hockey league
(
Citations: 1
)
Jari Kyngäs
,
Kimmo Nurmi
Conference:
IEEE Symposium on Computational Intelligence in Scheduling, CISCHED  SCIS
, 2009
An ILS heuristic for the traveling tournament problem with predefined venues
Fabr ´ icio
,
N. Costa Sebasti
,
Celso C. Ribeiro