Atan, TankutÇavdaroğlu, Burak2019-06-272019-06-272018130305-05481873-765X0305-05481873-765Xhttps://hdl.handle.net/20.500.12469/792https://doi.org/10.1016/j.cor.2018.06.003In 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. (C) 2018 Elsevier Ltd. All rights reserved.eninfo:eu-repo/semantics/closedAccessRound robin schedulingLeague fairnessRest mismatchMixed-integer linear programmingConstraint programmingNear optimal solutionArticle788999WOS:00044205940000710.1016/j.cor.2018.06.0032-s2.0-85049331619Q2Q1