Feasible Home-Away Table Construction with Minimal Breaks and Team Assignment for Scheduling a Tournament
-
- NAKATA Shuhei
- Seikei University
-
- WU Wei
- Shizuoka University
-
- IKEGAMI Atsuko
- Seikei University
Bibliographic Information
- Other Title
-
- ブレーク数最小許容HATの一括作成とチーム割当
- ブレーク数最小許容HATの一括作成とチーム割当 : J1リーグ2018年に対するスケジューリングへの適用
- ブレークスウ サイショウ キョヨウ HAT ノ イッカツ サクセイ ト チーム ワリアテ : J1 リーグ 2018ネン ニ タイスル スケジューリング エ ノ テキヨウ
- —Scheduling for J1 League 2018—
- —J1リーグ2018年に対するスケジューリングへの適用—
Search this article
Description
<p>In this paper, we propose a two-stage approach to schedule a double round-robin tournament. In the first stage, we create a home-away table (HAT) satisfying basic round-robin constraints with minimal breaks, as well as some constraints to improve the enjoyment of matches. In the second stage, we aim to find an assignment in which each team is assigned to exactly one row of the HAT generated, considering the total travel distance for each team. Finally, we show that the approach proposed successfully generates a yearly schedule for J1.League.</p>
Journal
-
- Journal of Japan Industrial Management Association
-
Journal of Japan Industrial Management Association 71 (2), 58-75, 2020-07-15
Japan Industrial Management Association
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390003825205818624
-
- NII Article ID
- 130007887787
-
- NII Book ID
- AN10561806
-
- ISSN
- 21879079
- 13422618
-
- NDL BIB ID
- 030565311
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed