Graph-based heuristics for rest difference minimisation

Tankut Atan, Tonguç Yavuz and Burak Çavdaroğlu

Journal of the Operational Research Society, 2025, vol. 76, issue 4, 725-738

Abstract: Complaints often arise from teams with less rest time between games in a tournament, highlighting the importance of minimising rest differences for fairness. Achieving fairness through rest difference minimisation is an empirically hard problem when determining the opponents and matchdays of teams in a tournament. To address this issue, we propose novel heuristic approaches based on graph theory. Remarkably, one of our heuristic methods significantly outperforms previously reported outcomes. We also show that the widely used canonical schedule has the maximum optimal rest difference value among all possible opponent schedules, and if the number of rounds is a prime number, shuffling the rounds within the canonical schedule offers no advantages in reducing rest differences. Furthermore, we present an efficient integer programming formulation to determine the total rest difference for a given opponent schedule.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2024.2390875 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:76:y:2025:i:4:p:725-738

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2024.2390875

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().