Fair-fixture: minimizing carry-over effects in football leagues

Title Fair-fixture: minimizing carry-over effects in football leagues
Author Danış, Dilek Günneç, Demir, E.
Publication Date: 2019-10
Publication Place - American Institute of Mathematical Sciences
Subject Sports scheduling, Carry-over effect, Break, Combinatorial optimization, Integer programming, Heuristics
Type Periodical
Language English
Digital Yes
Manuscript No
Library: Özyeğin University
Library Asset ID 1547-5816
Record ID c94dfc62-89d4-451a-82a0-c878fd52b53f
Library Location Industrial Engineering
Date 2019-10
Sample Text We 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.
DOI 10.3934/jimo.2018110
Cilt 15
View in source Özyeğin University Özyeğin University - Historical works, archives, and periodicals search engine
Özyeğin University - Historical works, archives, and periodicals search engine Özyeğin University

Fair-fixture: minimizing carry-over effects in football leagues

Author Danış, Dilek Günneç, Demir, E.
Publication Date 2019-10
Publication Place - American Institute of Mathematical Sciences
Subject Sports scheduling, Carry-over effect, Break, Combinatorial optimization, Integer programming, Heuristics
Type Periodical
Language English
Digital Yes
Manuscript No
Library Özyeğin University
Library Asset ID 1547-5816
Record ID c94dfc62-89d4-451a-82a0-c878fd52b53f
Library Location Industrial Engineering
Date 2019-10
Sample Text We 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.
DOI 10.3934/jimo.2018110
Cilt 15
Özyeğin University - Historical works, archives, and periodicals search engine
Özyeğin University You are being redirected...

Please wait