Minimizing costs in round robin tournaments with place constraints

Autor(en): Knust, Sigrid 
Luecking, Daniel
Stichwörter: Breaks; Computer Science; Computer Science, Interdisciplinary Applications; Engineering; Engineering, Industrial; Integer programming; LEAGUE; Operations Research & Management Science; Place constraints; Round robin tournament; Scheduling; Sports leagues
Erscheinungsdatum: 2009
Herausgeber: PERGAMON-ELSEVIER SCIENCE LTD
Journal: COMPUTERS & OPERATIONS RESEARCH
Volumen: 36
Ausgabe: 11
Startseite: 2937
Seitenende: 2943
Zusammenfassung: 
In this paper we consider a general sports league scheduling problem and propose solution algorithms for it. The objective is to find a feasible schedule for a round robin tournament with minimum number of breaks and minimum total costs where additionally place constraints are taken into account. We present a ``first-break, then-schedule'' approach which uses an enumerative procedure to generate home-away patterns and integer programming for finding corresponding schedules. Computational results are presented for leagues with up to 14 teams. (C) 2009 Elsevier Ltd. All rights reserved.
ISSN: 03050548
DOI: 10.1016/j.cor.2009.01.004

Show full item record

Page view(s)

2
Last Week
0
Last month
0
checked on Mar 2, 2024

Google ScholarTM

Check

Altmetric