A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib)

DOI10.1016/j.dam.2003.10.009zbMath1067.90511OpenAlexW1986046345MaRDI QIDQ1887059

Jin-Kao Hao, Jean-Philippe Hamiez

Publication date: 23 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.10.009

zbMATH Keywords

Linear-time algorithmRepair techniquesSports League Scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Construction of balanced sports schedules using partitions into subleagues ⋮ Using solution properties within an enumerative search to solve a sports league scheduling problem ⋮ Round robin scheduling -- a survey

Uses Software

• CSPLib
• Tabu search
• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geography, games and graphs
• Scheduling sport tournaments using constraint logic programming
• Scheduling a Major College Basketball Conference—Revisited
• Constructing timetables for sport competitions
• Scheduling in Sports
• Allocating Games for the NHL Using Integer Programming
• Scheduling the Australian State Cricket Season Using Simulated Annealing
• An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem
• Decompositions of complete graphs into regular bichromatic factors

This page was built for publication: A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib)