Abstract
Many sports leagues first announce the games to be played in each round and then determine their matchdays as the season progresses. This study focuses on the fairness criterion of minimizing the total rest difference among opposing teams to find the matchdays for an announced schedule. We show that the problem is decomposable into optimizing the rounds separately. We also provide a polynomial-time exact algorithm for canonical schedules.
Original language | English |
---|---|
Pages (from-to) | 209-216 |
Number of pages | 8 |
Journal | Operations Research Letters |
Volume | 48 |
Issue number | 3 |
Early online date | 10 Mar 2020 |
DOIs | |
Publication status | Published - 13 Mar 2020 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2020 Elsevier B.V.