Minimization of rest mismatches in round robin tournaments

Basit Öğe Kaydı
dc.authorid0000-0002-3241-4617
dc.authorid0000-0003-2756-5370
dc.contributor.authorAtan, Sabri Tankuten_US
dc.contributor.authorÇavdaroğlu, Buraken_US
dc.date.accessioned2018-12-07T02:17:41Z
dc.date.available2018-12-07T02:17:41Z
dc.date.issued2018-11-01
dc.departmentIşık Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.departmentIşık University, Faculty of Engineering, Department of Industrial Engineeringen_US
dc.description.abstractIn 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.en_US
dc.description.versionPublisher's Versionen_US
dc.identifier.citationAtan, 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.003en_US
dc.identifier.doi10.1016/j.cor.2018.06.003
dc.identifier.endpage89
dc.identifier.issn0305-0548
dc.identifier.issn1873-765X
dc.identifier.scopus2-s2.0-85049331619
dc.identifier.scopusqualityQ1
dc.identifier.startpage78
dc.identifier.urihttps://hdl.handle.net/11729/1400
dc.identifier.urihttp://dx.doi.org/10.1016/j.cor.2018.06.003
dc.identifier.volume99
dc.identifier.wosWOS:000442059400007
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakScience Citation Index Expanded (SCI-EXPANDED)en_US
dc.institutionauthorAtan, Sabri Tankuten_US
dc.institutionauthorid0000-0002-3241-4617
dc.language.isoenen_US
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.publisherPergamon-Elsevier Science Ltden_US
dc.relation.ispartofComputers and Operations Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectRound robin schedulingen_US
dc.subjectLeague fairnessen_US
dc.subjectRest mismatchen_US
dc.subjectMixed-integer linear programmingen_US
dc.subjectConstraint programmingen_US
dc.subjectNear optimal solutionen_US
dc.subjectConstrainten_US
dc.subjectLeaguesen_US
dc.subjectTennisen_US
dc.subjectTimesen_US
dc.subjectSportSen_US
dc.subjectCricketen_US
dc.subjectTraveling tournamenten_US
dc.subjectComputer programmingen_US
dc.subjectConstraint theoryen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectInteger programmingen_US
dc.subjectScheduling algorithmsen_US
dc.subjectRoutersen_US
dc.titleMinimization of rest mismatches in round robin tournamentsen_US
dc.typeArticleen_US
dspace.entity.typePublication

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
1400.pdf
Boyut:
746 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Publisher's Version
İndir
Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
license.txt
Boyut:
1.71 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

Makale Koleksiyonu | Endüstri Mühendisliği Bölümü
Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu