Scheduling sport competitions with a given distribution of times
Discrete Applied Mathematics
Combinatorial aspects of construction of competition Dutch Professional Football Leagues
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Scheduling a Major College Basketball Conference
Operations Research
Minimizing breaks by maximizing cuts
Operations Research Letters
Fair referee assignments for professional football leagues
Computers and Operations Research
IP models for round robin tournaments
Computers and Operations Research
Minimizing costs in round robin tournaments with place constraints
Computers and Operations Research
Scheduling the Belgian Soccer League
Interfaces
Scheduling the brazilian soccer tournament with fairness and broadcast objectives
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
On the application of graph colouring techniques in round-robin sports scheduling
Computers and Operations Research
Using a SAT-solver to schedule sports leagues
Journal of Scheduling
The timetable constrained distance minimization problem
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Soccer schedules in Europe: an overview
Journal of Scheduling
Computers and Industrial Engineering
| Hi-index | 0.01 |
Scheduling the Italian Major Football League (the so-called "Serie A") consists in finding for that league a double round robin tournament schedule that takes into account both typical requirements such as conditions on home-away matches and specific requests of the Italian Football Association such as twin-schedules for teams belonging to the same home-town. In this paper, we present a solution procedure able to derive feasible schedules that are also balanced with respect to additional cable televisions requirements. This procedure adapts the recent approach by Nemhauser and Trick to schedule a College Basketball Conference that considers however only half of the teams involved here. The proposed procedure is divided into three phases: phase 1 generates a pattern set respecting the cable televisions requirements and several other constraints; phase 2 produces a feasible round robin schedule compatible with the above pattern set; finally, phase 3 generates the actual calendar assigning the teams to the patterns. The procedure allows to generate within short time several different reasonable calendars satisfying the cable television companies requirements and satisfying various other operational constraints while minimizing the total number of violations on the home-away matches conditions.