A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib)

Authors:
Jean-Philippe Hamiez;Jin-Kao Hao
Affiliations:
LERIA--Université d'Angers, 2 boulevard Lavoisier, 49045 Angers Cedex 01, France and LGI2P--É des Mines d'Alès (EERIE), Parc Scientifique Georges Besse, 30035 Nîmes Cedex 01, F ...;LERIA--Université d'Angers, 2 boulevard Lavoisier, 49045 Angers Cedex 01, France
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 9
Cited 4

Allocating games for the NHL using integer programming

Operations Research
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Tabu Search

Tabu Search
Scheduling Sport Tournaments using Constraint Logic Programming

Constraints
Constraint Programming in OPL

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Solving the Sports League Scheduling Problem with Tabu Search

ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Solving the Round Robin Problem Using Propositional Logic

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Scheduling a Major College Basketball Conference

Operations Research
Scheduling a Major College Basketball Conference--Revisited

Operations Research

Using solution properties within an enumerative search to solve a sports league scheduling problem

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

Decision Support Systems
Sports league scheduling: enumerative search for prob026 from CSPLib

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Construction of balanced sports schedules using partitions into subleagues

Operations Research Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we present a repair-based linear-time algorithm to solve a version of the Sports League Seheduling Problem (SLSP) where the number T of teams is such that (T - 1) mod 3 ≠ 0. Starting with a conflicting schedule with particular properties, the algorithm removes iteratively the conflicts by exchanging matches. The properties of the initial schedule make it possible to take the optimal exchange at each iteration, leading to a linear-time algorithm. This algorithm can find thus valid schedules for several thousands of teams in less than 1 min. It is still an open question whether the SLSP can be solved efficiently when (T - 1) mod 3 = 0.