Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

ORL
2016

favoriteEmaildiscussreport

69views Operations Research» more ORL 2016»

Scheduling asynchronous round-robin tournaments

8 years 18 days ago

Scheduling asynchronous round-robin tournaments

Download cs.stanford.edu

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 diﬀerent schedule that performs optimally with respect to all measures when the number of teams is odd.

Warut Suksompong

Real-time Traffic

Operations Research | ORL 2016 |

claim paper

Related Content

» Constructing fair round robin tournaments with a minimum number of breaks

» Round robin scheduling a survey

» An Enhanced TimedRoundRobin Traffic Control Scheme for ATM Networks

» Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

» A Benders approach for the constrained minimum break problem

» A Dynamic Traffic Shaping Technique for a Scalable QoS in ATM Networks

Post Info
More Details (n/a)

Added	08 Apr 2016
Updated	08 Apr 2016
Type	Journal
Year	2016
Where	ORL
Authors	Warut Suksompong

Comments (0)