Determining matchdays in sports league schedules to minimize rest differences

DOI10.1016/J.ORL.2020.03.001MaRDI QIDQ2183190zbMATH OpenOpenAlexFDO

Authors Burak Cavdaroglu, Tankut S. Atan

Publication date 26 May 2020

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2020.03.001

zbMATH Keywords

canonical schedulesOR in sportsrest differencessports schedulingtournament fairness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Integer programming (90C10)

Review text

The problem of determining the matchdays for a fixed sports tournament schedule is considered. The objective is to find a fair schedule where opposing teams in matches do not have rest durations of different lengths after their games in the previous round. An integer linear programming formulation is provided to minimize the total rest difference among opposing teams. Furthermore, it is shown that the problem can be solved in polynomial time for the often used canonical schedules. Finally, computational results are presented for data from different European soccer leagues.

Recommendations

• Construction of balanced sports schedules using partitions into subleagues
• The multi-league sports scheduling problem, or how to schedule thousands of matches
• Scheduling sports competitions with a given distribution of times
• scientific article; zbMATH DE number 1728542
• Sports scheduling: problems and applications
• Multi-league sports scheduling with different leagues sizes
• A constrained sports scheduling problem
• Sports leagues scheduling. Models, combinatorial properties, and optimization algorithms.
• Constructing fair sports league schedules with regard to strength groups

Cites work

• A polynomial-time algorithm to find an equitable home--away assignment
• A Tournament Design Problem
• Constructing fair round robin tournaments with a minimum number of breaks
• scientific article; zbMATH DE number 1016456 (Why is no real title available?)
• IP models for round robin tournaments
• Memetic algorithm timetabling for non-commercial sport leagues.
• Minimization of rest mismatches in round robin tournaments
• Minimizing breaks by maximizing cuts.
• P-Complete Approximation Problems
• Round robin scheduling -- a survey
• Round-robin tournaments generated by the circle method have maximum carry-over
• Scheduling a non-professional indoor football league: a tabu search based approach
• Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem
• Scheduling asynchronous round-robin tournaments
• Scheduling in Sports
• Scheduling non-professional table-tennis leagues
• Scheduling sports tournaments on a single court minimizing waiting times

Cited in

(9)

• Minimization of rest mismatches in round robin tournaments
• Integrated break and carryover effect minimization
• Optimizing rest times and differences in games played: an iterative two-phase approach
• Let's meet as usual: do games played on non-frequent days differ? Evidence from top European soccer leagues
• A traditional Benders' approach to sports timetabling
• Round-robin scheduling with regard to rest differences
• Minimal and fair waiting times for single-day sports tournaments with multiple fields
• Tournament design: a review from an operational research perspective
• Construction of balanced sports schedules using partitions into subleagues

Describes a project that uses

Uses Software

• Gurobi

This page was built for publication: Determining matchdays in sports league schedules to minimize rest differences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183190)