Scheduling a triple round robin tournament with minitournaments for the Finnish national youth ice hockey league
| Autor: | Dries Goossens, Kimmo Nurmi, Jari Kyngäs |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Marketing
Operations research Computer science Strategy and Management ComputingMilieux_PERSONALCOMPUTING 010103 numerical & computational mathematics 02 engineering and technology Management Science and Operations Research League 01 natural sciences Management Information Systems Scheduling (computing) Ice hockey 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Tournament Operations management 0101 mathematics |
| Zdroj: | Journal of the Operational Research Society. 65:1770-1779 |
| ISSN: | 1476-9360 0160-5682 |
| DOI: | 10.1057/jors.2013.154 |
| Popis: | This paper presents a method to schedule a triple round robin tournament, which involves minitournaments, each hosted by one team. A key issue is that at the end of the season the number of home games should be balanced over the teams, despite the fact that in minitournament matches only the host team plays at home. This format is played in the Finnish national ice hockey league for players under the age of 20 years, where the problem is further complicated by many other constraints, for example, preassigned matches resulting from away tours that should limit the distances travelled by the teams. To obtain a schedule for this league, we sequentially solve four distinct combinatorial problems. This method allows us to construct a schedule for the 2009–2010 season, which is superior to the official schedule: it has no hard constraint violations, and outperforms the official schedule on three of five soft constraints. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink