A constraint programming approach to the multiple-venue, sport-scheduling problem

Authors:
Robert A. Russell;Timothy L. Urban
Affiliations:
Operations Management, The University of Tulsa, Tulsa, Ok;Operations Management, The University of Tulsa, Tulsa, Ok
Venue:
Computers and Operations Research
Year:
2006

Citing 5
Cited 6

Combinatorial aspects of construction of competition Dutch Professional Football Leagues

Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Scheduling Sport Tournaments using Constraint Logic Programming

Constraints
Scheduling a Major College Basketball Conference

Operations Research
Scheduling a Major College Basketball Conference--Revisited

Operations Research
Constraint and Integer Programming in OPL

INFORMS Journal on Computing

Construction of sports schedules with multiple venues

Discrete Applied Mathematics
On the existence of sports schedules with multiple venues

Discrete Applied Mathematics
Fashioning fair foursomes for the fairway (using a spreadsheet-based DSS as the driver)

Decision Support Systems
Construction of sports schedules with multiple venues

Discrete Applied Mathematics
Construction of balanced sports schedules using partitions into subleagues

Operations Research Letters
Sports tournament scheduling to determine the required number of venues subject to the minimum timeslots under given formats

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we consider the problem of scheduling sports competitions over several venues which are not associated with any of the competitors. A two-phase, constraint programming approach is developed, first identifying a solution that designates the participants and schedules each of the competitions, then assigning each competitor as the "home" or the "away" team. Computational experiments are conducted and the results are compared with an integer goal programming approach. The constraint programming approach achieves optimal solutions for problems with up to sixteen teams, and near-optimal solutions for problems with up to thirty teams.