Danış, Dilek GünneçDemir, E.2020-06-302020-06-302019-101547-5816http://hdl.handle.net/10679/6669https://doi.org/10.3934/jimo.2018110We study a sports scheduling problem with the objective of minimizing carry-over effects in round robin tournaments. In the first part, focusing on tournaments that allow minimum number of breaks (at most one) for each team, we formulate an integer programming model and provide an efficient heuristic algorithm to solve this computationally expensive problem. We apply the algorithm to the current Turkish Professional Football League and present an alternative scheduling template. In the second part, we discuss how the carry-over effects can be further decreased if the number of breaks is allowed to be of slightly larger value and numerically represent this trade-off.engrestrictedAccessarticle1541565157700047437540000310.3934/jimo.2018110Sports schedulingCarry-over effectBreakCombinatorial optimizationInteger programmingHeuristics2-s2.0-85073270330