Handling fairness issues in time-relaxed tournaments with availability constraints

DOI10.1016/J.COR.2019.104856zbMath1458.90359OpenAlexW2984583010WikidataQ126776009 ScholiaQ126776009MaRDI QIDQ2289924

David Van Bulck, Dries R. Goossens

Publication date: 27 January 2020

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.104856

zbMATH Keywords

evolutionary algorithmcomplexity theorybipartite tournamentfix-and-optimizeround-robin tournamenttime-relaxed sports scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Relax-fix-optimize heuristics for time-relaxed sports timetabling ⋮ The efficacy of tournament designs ⋮ Optimizing rest times and differences in games played: an iterative two-phase approach ⋮ On the complexity of pattern feasibility problems in time-relaxed sports timetabling ⋮ A quest for a fair schedule: the international Young Physicists' Tournament ⋮ Multi-league sports scheduling with different leagues sizes ⋮ A traditional Benders' approach to sports timetabling ⋮ Round-robin scheduling with regard to rest differences

Uses Software

• Gurobi
• irace
• Dlib-ml
• RobinX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge coloring: a natural model for sports scheduling
• The tournament scheduling problem with absences
• A fix-and-optimize heuristic for the high school timetabling problem
• Scheduling in sports: an annotated bibliography
• Proof of the list edge coloring conjecture for complete graphs of prime degree
• Balanced home-away assignments
• Scheduling non-professional table-tennis leagues
• Combinatorial aspects of construction of competition Dutch professional football leagues
• List edge and list total colourings of multigraphs
• Variable neighborhood search
• Memetic algorithm timetabling for non-commercial sport leagues.
• Minimization of rest mismatches in round robin tournaments
• Scheduling the South American qualifiers to the 2018 FIFA world cup by integer programming
• Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem
• The sport teams grouping problem
• Scheduling asynchronous round-robin tournaments
• The list chromatic index of a bipartite multigraph
• Record breaking optimization results using the ruin and recreate principle
• RobinX: a three-field classification and unified data format for round-robin sports timetabling
• Scheduling a non-professional indoor football league: a tabu search based approach
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• Using graphs for some discrete tomography problems
• Assignment Problems
• Scheduling in Sports
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem
• Introduction to evolutionary computing
• On completing latin squares

This page was built for publication: Handling fairness issues in time-relaxed tournaments with availability constraints