Applications of Constraint Programming in Sports Scheduling

Name: Troy Baughman
Majors: Mathematics
Advisors: Dr. Heather Guarnera

Sports scheduling problems comprise in deciding the date and the setting in which each round of competition will be played. Constraint programming, integer programming, and dynamic programming have been effectively applied to the arrangement of various sports schedules. This paper discusses how constraint programming is utilized in sports scheduling as it is applied to football, baseball, basketball, cricket, hockey, and so forth. Several applications of each approach of constraint, integer, dynamic, and goal programming are all presented. The constraints associated with sports scheduling are discussed, which include the use of multiple venues, the distance traveled by a team, and reducing player fatigue from back to back games (the carry-etc). The Traveling Tournament Problem, which is the problem to minimize total distance across all teams scheduled, is also discussed.