Sciweavers

6 search results - page 1 / 2
» Scheduling asynchronous round-robin tournaments
Sort
View
ORL
2010
158views more  ORL 2010»
13 years 5 months ago
Constructing fair round robin tournaments with a minimum number of breaks
Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the ...
Pim van 't Hof, Gerhard F. Post, Dirk Briskorn
EOR
2008
96views more  EOR 2008»
13 years 11 months ago
Round robin scheduling - a survey
Abstract 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 toda...
Rasmus V. Rasmussen, Michael A. Trick
LCN
1996
IEEE
14 years 3 months ago
An Enhanced Timed-Round-Robin Traffic Control Scheme for ATM Networks
ATM (asynchronous transfer mode) aims at providing both guaranteed bandwidth to support real-time communications and dynamic bandwidth sharing to accommodate bursty data traffic. ...
Qin Zheng
DAM
2006
118views more  DAM 2006»
13 years 11 months ago
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization ...
Sebastián Urrutia, Celso C. Ribeiro
EOR
2007
174views more  EOR 2007»
13 years 10 months ago
A Benders approach for the constrained minimum break problem
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 without ...
Rasmus V. Rasmussen, Michael A. Trick