Show simple item record

dc.contributor.authorAtan, 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.identifier.citationAtan, T., & Çavdaroğlu, B. (2018). Minimization of rest mismatches in round robin tournaments. Computers and Operations Research, 99, 78-89.en_US
dc.identifier.issn0305-0548
dc.identifier.issn1873-765X
dc.identifier.otherWOS:000442059400007
dc.identifier.urihttps://hdl.handle.net/11729/1400
dc.identifier.urihttp://dx.doi.org/10.1016/j.cor.2018.06.003
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.language.isoengen_US
dc.publisherPergamon-Elsevier Science Ltden_US
dc.relation.isversionof10.1016/j.cor.2018.06.003
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.sourceComputers and Operations Researchen_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
dc.description.versionPublisher's Versionen_US
dc.contributor.departmentIşık Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.contributor.departmentIşık University, Faculty of Engineering, Department of Industrial Engineeringen_US
dc.contributor.authorID23838
dc.contributor.authorID37637
dc.identifier.volume99
dc.identifier.startpage78
dc.identifier.endpage89
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryBelirsizen_US
dc.contributor.institutionauthorAtan, Tankut


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record