Minimization of rest mismatches in round robin tournaments

Yükleniyor...
Küçük Resim

Tarih

2018-11-01

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Pergamon-Elsevier Science Ltd

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Araştırma projeleri

Organizasyon Birimleri

Dergi sayısı

Özet

In sports tournaments, an occurrence of a difference in the rest periods of opponent teams in a game, which we refer to as a rest mismatch, will disadvantage the less rested team. Thus, it is only fair to expect opposing teams to have rested equally before their game. In this work, we introduce and study the Rest Mismatch Problem where the goal is to minimize the number of rest mismatches in a round robin tournament. Two integer linear formulations and a constraint programming formulation are provided, and their computational performances are compared for several problem instances. Moreover, a heuristic algorithm is developed which finds a single round robin schedule with zero mismatches when the number of teams in the tournament is a multiple of 8, and four mismatches when it is a multiple of 4 but not 8.

Açıklama

Anahtar Kelimeler

Round robin scheduling, League fairness, Rest mismatch, Mixed-integer linear programming, Constraint programming, Near optimal solution, Constraint, Leagues, Tennis, Times, SportS, Cricket, Traveling tournament, Computer programming, Constraint theory, Heuristic algorithms, Integer programming, Scheduling algorithms, Routers

Kaynak

Computers and Operations Research

WoS Q Değeri

Q2
Q2

Scopus Q Değeri

Q1

Cilt

99

Sayı

Künye

Atan, S. T. & Çavdaroğlu, B. (2018). Minimization of rest mismatches in round robin tournaments. Computers and Operations Research, 99, 78-89. doi:10.1016/j.cor.2018.06.003