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

Name: Fair-fixture: minimizing carry-over effects in football leagues
Author: Danış, Dilek Günneç, Demir, E.

İsim	Fair-fixture: minimizing carry-over effects in football leagues
Yazar	Danış, Dilek Günneç, Demir, E.
Basım Tarihi:	2019-10
Basım Yeri	- American Institute of Mathematical Sciences
Konu	Sports scheduling, Carry-over effect, Break, Combinatorial optimization, Integer programming, Heuristics
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1547-5816
Kayıt Numarası	c94dfc62-89d4-451a-82a0-c878fd52b53f
Lokasyon	Industrial Engineering
Tarih	2019-10
Örnek Metin	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

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

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

Yazar Danış, Dilek Günneç, Demir, E.

Basım Tarihi 2019-10

Basım Yeri - American Institute of Mathematical Sciences

Konu Sports scheduling, Carry-over effect, Break, Combinatorial optimization, Integer programming, Heuristics

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1547-5816

Kayıt Numarası c94dfc62-89d4-451a-82a0-c878fd52b53f

Lokasyon Industrial Engineering

Tarih 2019-10

Örnek Metin 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