Graph-based heuristics for rest difference minimisation

Basit Öğe Kaydı
dc.authorid0000-0003-2756-5370
dc.authorid0000-0003-0187-0588
dc.contributor.authorAtan, Tankut
dc.contributor.authorYavuz, Tonguc
dc.contributor.authorCavdaroglu, Burak
dc.date.accessioned2026-04-04T18:55:39Z
dc.date.available2026-04-04T18:55:39Z
dc.date.issued2025
dc.departmentİstanbul Bilgi Üniversitesi
dc.description.abstractComplaints 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.
dc.description.sponsorshipThe authors would like to thank the anonymous referees for their thoughtful reading of the manuscript and for their clarifying comments.
dc.identifier.doi10.1080/01605682.2024.2390875
dc.identifier.doi10.1080/01605682.2024.2390875
dc.identifier.endpage738
dc.identifier.issn0160-5682
dc.identifier.issn1476-9360
dc.identifier.issue4
dc.identifier.scopus2-s2.0-105001943634
dc.identifier.scopusqualityQ1
dc.identifier.startpage725
dc.identifier.urihttps://doi.org/10.1080/01605682.2024.2390875
dc.identifier.urihttps://hdl.handle.net/11411/10511
dc.identifier.volume76
dc.identifier.wosWOS:001294232600001
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherTaylor & Francis Ltd
dc.relation.ispartofJournal of the Operational Research Society
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260402
dc.snmzKA_Scopus_20260402
dc.subjectGraph Theory
dc.subjectHeuristic Methods
dc.subjectOr In Sports
dc.subjectRest Difference Minimisation
dc.subjectRound-Robin Tournaments
dc.titleGraph-based heuristics for rest difference minimisation
dc.typeArticle

Dosyalar

Koleksiyon

Web of Science Indexed Publications
Scopus Indexed Publications